6004 search results - page 543 / 1201 » Parallelizing query optimization |
154
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
142
Voted
SEMWEB
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. There is a growing discrepancy between the creation of digital content and its actual employment and usefulness in a learning society. Technologies for recording lectures...
166
click to vote
SC
2003
ACM
15 years 12 months ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
177
click to vote
GLOBECOM
2007
IEEE
16 years 29 days ago
2007
IEEE
—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwareba...
209
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee indi...