32545 search results - page 229 / 6509 » Data Structures and Algorithms |
128
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
177
click to vote
WDAG
2010
Springer
15 years 1 months ago
2010
Springer
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
131
click to vote
ICDT
1995
ACM
15 years 7 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
132
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
149
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...