Sciweavers

66 search results - page 7 / 14
» Scalable similarity search with optimized kernel hashing
Sort
View
78
Voted
HOTOS
2007
IEEE
15 years 1 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
ICCV
2011
IEEE
13 years 9 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
15 years 3 months ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin
P2P
2006
IEEE
211views Communications» more  P2P 2006»
15 years 3 months ago
Comparison of Image Similarity Queries in P2P Systems
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...
Wolfgang Müller 0002, P. Oscar Boykin, Nima S...
PR
2006
101views more  PR 2006»
14 years 9 months ago
Feature-based approach to semi-supervised similarity learning
For the management of digital document collections, automatic database analysis still has ties to deal with semantic queries and abstract concepts that users are looking for. When...
Philippe Henri Gosselin, Matthieu Cord