Sciweavers

3575 search results - page 100 / 715
» Structured motifs search
Sort
View
ISMIS
1999
Springer
15 years 10 months ago
Improving Backtrack Search for SAT by Means of Redundancy
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
Laure Brisoux, Éric Grégoire, Lakhda...
BMCBI
2008
123views more  BMCBI 2008»
15 years 6 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
ER
2007
Springer
99views Database» more  ER 2007»
16 years 18 days ago
VERT: A Semantic Approach for Content Search and Content Extraction in XML Query Processing
Processing a twig pattern query in XML document includes structural search and content search. Most existing algorithms only focus on structural search. They treat content nodes th...
Huayu Wu, Tok Wang Ling, Bo Chen
CVPR
2007
IEEE
16 years 8 months ago
A contextual dissimilarity measure for accurate and efficient image search
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
Herve Jegou, Hedi Harzallah, Cordelia Schmid
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 10 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani