11345 search results - page 1832 / 2269 » Foundations of Computer Science |
196
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
192
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
206
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
186
Voted
CSCW
2000
ACM
15 years 11 months ago
2000
ACM
WebSplitter symbolizes the union of pervasive multi-device computing and collaborative multi-user computing. WebSplitter provides a unified XML framework that enables multi-device...
216
Voted
EDBT
2000
ACM
15 years 11 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...