Sciweavers

169 search results - page 15 / 34
» Balanced Two-sided Matching
Sort
View
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
14 years 1 days ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
KIVS
2005
Springer
14 years 1 months ago
On the Distribution of Nodes in Distributed Hash Tables
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
Heiko Niedermayer, Simon Rieche, Klaus Wehrle, Geo...
SIAMCOMP
2000
99views more  SIAMCOMP 2000»
13 years 7 months ago
Squarish k-d Trees
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
Luc Devroye, Jean Jabbour, Carlos Zamora-Cura
ISPDC
2007
IEEE
14 years 2 months ago
Selection of Optimal Computing Platforms through the Suitability Measure
Selection of spaceborne computing platforms requires balance among several competing factors. Traditional performance analysis techniques are illsuited for this purpose due to the...
Shean T. McMahon, Isaac D. Scherson
INFOCOM
2005
IEEE
14 years 1 months ago
TCAM-based distributed parallel packet classification algorithm with range-matching solution
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
Kai Zheng, Hao Che, Zhijun Wang, Bin Liu