Sciweavers

6004 search results - page 926 / 1201
» Parallelizing query optimization
Sort
View
ASM
2004
ASM
16 years 20 hour ago
Intra-step Interaction
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
Yuri Gurevich
MIDDLEWARE
2004
Springer
15 years 12 months ago
Foreseer: A Novel, Locality-Aware Peer-to-Peer System Architecture for Keyword Searches
Peer-to-peer (P2P) systems are becoming increasingly popular and complex, serving millions of users today. However, the design of current unstructured P2P systems does not take ful...
Hailong Cai, Jun Wang
162
Voted
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 11 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
BMCBI
2010
142views more  BMCBI 2010»
15 years 6 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
BMCBI
2010
122views more  BMCBI 2010»
15 years 6 months ago
Fast and accurate protein substructure searching with simulated annealing and GPUs
Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioin...
Alex Stivala, Peter J. Stuckey, Anthony Wirth