Sciweavers

1136 search results - page 164 / 228
» Finding Small Holes
Sort
View
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
14 years 9 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
RECOMB
2008
Springer
14 years 9 months ago
Constructing Treatment Portfolios Using Affinity Propagation
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
Delbert Dueck, Brendan J. Frey, Nebojsa Jojic, Vla...
RECOMB
2004
Springer
14 years 9 months ago
The Distribution of Inversion Lengths in Bacteria
The distribution of the lengths of genomic segments inverte during the evolutionary divergence of two species cannot be inferred d rectly from the output of genome rearrangement al...
Adrian Maler, David Sankoff, Elisabeth R. M. Tilli...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 9 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...