Sciweavers

9260 search results - page 1802 / 1852
» Posterior distributions are computable from predictive distr...
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 26 days ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
106
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 26 days 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
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
16 years 26 days ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
185
Voted
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 24 days ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
194
Voted
SIGMOD
2009
ACM
184views Database» more  SIGMOD 2009»
16 years 24 days ago
Minimizing the communication cost for continuous skyline maintenance
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
Zhenjie Zhang, Reynold Cheng, Dimitris Papadias, A...
« Prev « First page 1802 / 1852 Last » Next »