Sciweavers

630 search results - page 123 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
JAIR
2008
103views more  JAIR 2008»
14 years 9 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
15 years 10 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
MOBICOM
2006
ACM
15 years 3 months ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz
VLDB
1992
ACM
151views Database» more  VLDB 1992»
15 years 1 months ago
Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB
This paper evaluates the performance of the parallel, main-memory DBMS, PRISMA/DB. First, an architecture for parallel query execution is presented. A performance model for the ex...
Annita N. Wilschut, Jan Flokstra, Peter M. G. Aper...
ADHOC
2005
143views more  ADHOC 2005»
14 years 9 months ago
Active query forwarding in sensor networks
While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mech...
Narayanan Sadagopan, Bhaskar Krishnamachari, Ahmed...