Sciweavers

17582 search results - page 3484 / 3517
» From Distributed Sequential Computing to Distributed Paralle...
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 2 months 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
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 2 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
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
16 years 2 months 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
SIGMOD
2009
ACM
184views Database» more  SIGMOD 2009»
16 years 2 months 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...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 2 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
« Prev « First page 3484 / 3517 Last » Next »