Sciweavers

322 search results - page 25 / 65
» On the Complexity of Reverse Similarity Search
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
The inverted multi-index
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
Artem Babenko, Victor S. Lempitsky
BMCBI
2007
115views more  BMCBI 2007»
13 years 8 months ago
Local comparison of protein structures highlights cases of convergent evolution in analogous functional sites
Background: We performed an exhaustive search for local structural similarities in an ensemble of non-redundant protein functional sites. With the purpose of finding new examples ...
Gabriele Ausiello, Daniele Peluso, Allegra Via, Ma...
IJCAI
2003
13 years 10 months ago
Concept Linking for Information Integration in Open Book and Sentinel
Opening up large amounts of loosely structured information for easy access and use is a complex problem. This paper describes two systems that address different aspects of the pro...
Stuart Watt
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 1 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
ASE
1998
81views more  ASE 1998»
13 years 8 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang