Sciweavers

323 search results - page 52 / 65
» Distributed Verification and Hardness of Distributed Approxi...
Sort
View
SIGIR
2008
ACM
13 years 7 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 1 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
WWW
2008
ACM
14 years 8 months ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
ASPLOS
2009
ACM
14 years 8 months ago
Mixed-mode multicore reliability
Future processors are expected to observe increasing rates of hardware faults. Using Dual-Modular Redundancy (DMR), two cores of a multicore can be loosely coupled to redundantly ...
Philip M. Wells, Koushik Chakraborty, Gurindar S. ...