1046 search results - page 129 / 210 » Approximation Algorithms for Domination Search |
120
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
130
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
241
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
160
click to vote
SSDBM
2010
IEEE
15 years 7 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
136
click to vote
CCS
2007
ACM
15 years 9 months ago
2007
ACM
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...