Sciweavers

87 search results - page 15 / 18
» Using hashing to solve the dictionary problem
Sort
View
COREGRID
2007
Springer
14 years 1 months ago
Atomic Commitment in Transactional DHTs
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...
Monika Moser, Seif Haridi
SERSCISA
2010
Springer
13 years 9 months ago
A Novel Approach Based on Fault Tolerance and Recursive Segmentation to Query by Humming
With the explosive growth of digital music, content-based music information retrieval especially query by humming/singing have been attracting more and more attention and are beco...
Xiaohong Yang, Qingcai Chen, Xiaolong Wang
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 7 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
ICCV
2011
IEEE
12 years 7 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 ...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci