9849 search results - page 1760 / 1970 » Algorithms and Experiments for the Webgraph |
197
click to vote
ICDE
2010
IEEE
16 years 28 days ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
144
click to vote
ASPLOS
2010
ACM
16 years 27 days ago
2010
ACM
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
169
click to vote
SAC
2010
ACM
16 years 27 days ago
2010
ACM
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
177
click to vote
EDBT
2010
ACM
16 years 26 days ago
2010
ACM
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
172
click to vote
SAC
2009
ACM
16 years 25 days ago
2009
ACM
Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any central...