Sciweavers

247 search results - page 5 / 50
» Scaling up all pairs similarity search
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair
CVPR
2010
IEEE
14 years 4 months ago
Semi-supervised Hashing for Scalable Image Retrieval
Large scale image search has recently attracted considerable attention due to easy availability of huge amounts of data. Several hashing methods have been proposed to allow approx...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
GCB
1997
Springer
77views Biometrics» more  GCB 1997»
13 years 12 months ago
Statistics of large scale sequence searching
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
Rainer Spang, Martin Vingron
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
KES
2010
Springer
13 years 6 months ago
DOCODE-Lite: A Meta-Search Engine for Document Similarity Retrieval
The retrieval of similar documents from large scale datasets has been the one of the main concerns in knowledge management environments, such as plagiarism detection, news impact a...
Felipe Bravo-Marquez, Gaston L'Huillier, Sebasti&a...