32545 search results - page 67 / 6509 » Data Structures and Algorithms |
132
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
127
click to vote
CIMCA
2008
IEEE
15 years 4 months ago
2008
IEEE
XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and q...
111
click to vote
DASFAA
2008
IEEE
15 years 9 months ago
2008
IEEE
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
119
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
136
click to vote
SSDBM
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...