Sciweavers

555 search results - page 70 / 111
» Aggregate Evaluability in Statistical Databases
Sort
View
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 5 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
SIGCOMM
2010
ACM
15 years 2 days ago
Ripcord: a modular platform for data center networking
In this demo, we present Ripcord, a modular platform for rapidly prototyping scale-out data center networks. Ripcord enables researchers to build and evaluate new network features...
Brandon Heller, David Erickson, Nick McKeown, Rean...
SIGIR
2011
ACM
14 years 2 months ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
16 years 1 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 5 hour ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...