4886 search results - page 395 / 978 » Approximate Data Exchange |
173
click to vote
SEFM
2006
IEEE
16 years 22 days ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
218
click to vote
KDD
2004
ACM
16 years 2 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
201
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
238
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
197
click to vote
JACM
2012
13 years 9 months ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...