Sciweavers

2490 search results - page 321 / 498
» The Generalized Theory of Model Preference
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 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
ATAL
2009
Springer
15 years 11 months ago
The price of democracy in coalition formation
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
Georgios Chalkiadakis, Edith Elkind, Maria Polukar...
PODS
2006
ACM
134views Database» more  PODS 2006»
16 years 4 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
WWW
2010
ACM
15 years 11 months ago
Predicting positive and negative links in online social networks
We study online social networks in which relationships can be either positive (indicating relations such as friendship) or negative (indicating relations such as opposition or ant...
Jure Leskovec, Daniel P. Huttenlocher, Jon M. Klei...
EDBTW
2010
Springer
15 years 11 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart