Sciweavers

882 search results - page 92 / 177
» Local Search for Very Large SAT Problems
Sort
View
CVPR
2000
IEEE
16 years 6 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari
ESWS
2008
Springer
15 years 5 months ago
Q2Semantic: A Lightweight Keyword Interface to Semantic Search
The increasing amount of data on the Semantic Web offers opportunities for semantic search. However, formal query hinders the casual users in expressing their information need as t...
Haofen Wang, Kang Zhang, Qiaoling Liu, Thanh Tran,...
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 9 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...
BMCBI
2007
177views more  BMCBI 2007»
15 years 4 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
SPAA
1997
ACM
15 years 8 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...