Sciweavers

371 search results - page 34 / 75
» On Two-Dimensional Indexability and Optimal Range Search Ind...
Sort
View
JETAI
2007
141views more  JETAI 2007»
14 years 9 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
DKE
2007
162views more  DKE 2007»
14 years 9 months ago
A new algorithm for clustering search results
We develop a new algorithm for clustering search results. Differently from many other clustering systems that have been recently proposed as a post-processing step for Web search ...
Giansalvatore Mecca, Salvatore Raunich, Alessandro...
WEBI
2009
Springer
15 years 4 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
141
Voted
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 1 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
BIOCOMP
2007
14 years 11 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
Xuehui Li, Tamer Kahveci