Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,982,087 papers from all fields of science
Search
Sign In
Create Free Account
Dataspaces
Known as:
Data Spaces
, Data space
, Dataspace
Dataspaces are an abstraction in data management that aim to overcome some of the problems encountered in data integration system. The aim is to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Conceptual graph
Data mining
Neuromancer
Semantic integration
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Autoencoding beyond pixels using a learned similarity metric
Anders Boesen Lindbo Larsen
,
Søren Kaae Sønderby
,
H. Larochelle
,
O. Winther
International Conference on Machine Learning
2015
Corpus ID: 8785311
We present an autoencoder that leverages learned representations to better measure similarities in data space. By combining a…
Expand
Highly Cited
2010
Highly Cited
2010
DataSpaces: an interaction and coordination framework for coupled simulation workflows
C. Docan
,
M. Parashar
,
S. Klasky
Cluster Computing
2010
Corpus ID: 15033012
Emerging high-performance distributed computing environments are enabling new end-to-end formulations in science and engineering…
Expand
Highly Cited
2006
Highly Cited
2006
Principles of dataspace systems
A. Halevy
,
M. Franklin
,
D. Maier
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
2006
Corpus ID: 7325481
The most acute information management challenges today stem from organizations relying on a large number of diverse, interrelated…
Expand
Highly Cited
2003
Highly Cited
2003
Pervasive Computing: A Paradigm for the 21st Century
Debashis Saha
,
A. Mukherjee
Computer
2003
Corpus ID: 2425134
Pervasive computing promises to make life simpler via digital environments that sense, adapt, and respond to human needs. Yet we…
Expand
Highly Cited
2002
Highly Cited
2002
Solving Fredholm integrals of the first kind with tensor product structure in 2 and 2.5 dimensions
Lalitha Venkataramanan
,
Yi-Qiao Song
,
M. Hurlimann
IEEE Transactions on Signal Processing
2002
Corpus ID: 36245178
We present an efficient algorithm to solve a class of two- and 2.5-dimensional (2-D and 2.5-D) Fredholm integrals of the first…
Expand
Highly Cited
2002
Highly Cited
2002
Diffusion kernels on graphs and other discrete structures
R. Kondor
International Conference on Machine Learning
2002
Corpus ID: 8606662
The application of kernel-based learning algorithms has, so far, largely been confined to real-valued data and a few special data…
Expand
Highly Cited
1999
Highly Cited
1999
Fast algorithms for projected clustering
C. Aggarwal
,
Cecilia M. Procopiuc
,
J. Wolf
,
Philip S. Yu
,
Jong Soo Park
ACM SIGMOD Conference
1999
Corpus ID: 16144421
The clustering problem is well known in the database literature for its numerous applications in problems such as customer…
Expand
Highly Cited
1998
Highly Cited
1998
GTM: The Generative Topographic Mapping
Charles M. Bishop
,
M. Svensén
,
Christopher K. I. Williams
Neural Computation
1998
Corpus ID: 207605229
Latent variable models represent the probability density of data in a space of several dimensions in terms of a smaller number of…
Expand
Highly Cited
1997
Highly Cited
1997
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
P. Ciaccia
,
M. Patella
,
P. Zezula
Very Large Data Bases Conference
1997
Corpus ID: 15393774
A new access method, called M-tree, is proposed to organize and search large data sets from a generic “metric space”, i.e. where…
Expand
Highly Cited
1977
Highly Cited
1977
DISTINGUISHING VEGETATION FROM SOIL BACKGROUND INFORMATION
A. J. Richardsons
,
A. Wiegand
1977
Corpus ID: 126604551
Landsat-1 and -2 multispectral scanner (MSS) data from six overpass dates (April 2, May 17, June 4, July 10, October 17, and…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE