Sciweavers

1925 search results - page 295 / 385
» Theory research at Google
Sort
View
MOBIHOC
2008
ACM
16 years 5 months ago
Multicast capacity for hybrid wireless networks
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
XuFei Mao, Xiang-Yang Li, ShaoJie Tang
WWW
2009
ACM
16 years 7 months ago
How opinions are received by online communities: a case study on amazon.com helpfulness votes
There are many on-line settings in which users publicly express opinions. A number of these offer mechanisms for other users to evaluate these opinions; a canonical example is Ama...
Cristian Danescu-Niculescu-Mizil, Gueorgi Kossinet...
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
16 years 6 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 6 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine