664 search results - page 116 / 133 » Answering order-based queries over XML data |
135
Voted
EDBT
2004
ACM
16 years 18 days ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
128
Voted
BMCBI
2007
15 years 14 days ago
2007
Background: Neuroscientists often need to access a wide range of data sets distributed over the Internet. These data sets, however, are typically neither integrated nor interopera...
154
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
169
click to vote
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
207
Voted
PODS
2009
ACM
16 years 1 months ago
2009
ACM
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...