Sciweavers

154 search results - page 24 / 31
» Approximate String Matching: A Simpler Faster Algorithm
Sort
View
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
15 years 8 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
EDBT
2010
ACM
116views Database» more  EDBT 2010»
15 years 6 months ago
HARRA: fast iterative hashed record linkage for large-scale data collections
We study the performance issue of the “iterative” record linkage (RL) problem, where match and merge operations may occur together in iterations until convergence emerges. We ...
Hung-sik Kim, Dongwon Lee
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 3 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
VLDB
2003
ACM
147views Database» more  VLDB 2003»
15 years 12 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
ECCC
2000
140views more  ECCC 2000»
14 years 11 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis