Sciweavers

910 search results - page 30 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
121
Voted
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
16 years 4 months ago
Validating Multi-column Schema Matchings by Type
Validation of multi-column schema matchings is essential for successful database integration. This task is especially difficult when the databases to be integrated contain little o...
Bing Tian Dai, Nick Koudas, Divesh Srivastava, Ant...
DEBU
2010
108views more  DEBU 2010»
15 years 2 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
SIAMCOMP
1998
113views more  SIAMCOMP 1998»
15 years 2 months ago
Two-Dimensional Periodicity in Rectangular Arrays
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
Amihood Amir, Gary Benson

Lecture Notes
673views
17 years 23 days ago
Combinatorial Algorithms
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
Jeff Erickson