Sciweavers

9997 search results - page 1867 / 2000
» The case for crowd computing
Sort
View
MOBIHOC
2001
ACM
15 years 9 months ago
Implicit source routes for on-demand ad hoc network routing
In an ad hoc network, the use of source routing has many advantages, including simplicity, correctness, and flexibility. For example, all routing decisions for a packet are made b...
Yih-Chun Hu, David B. Johnson

Publication
466views
15 years 8 months ago
Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Search Auctions
In pay-per click sponsored search auctions which are cur- rently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) c...
Akash Das Sarma, Sujit Gujar, Y. Narahari
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 7 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 7 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
« Prev « First page 1867 / 2000 Last » Next »