Sciweavers

313 search results - page 1 / 63
» Color matching by using tuple matching
Sort
View
ICIAP
2003
ACM
13 years 9 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
PDCN
2007
13 years 6 months ago
Modified collision packet classification using counting bloom filter in tuple space
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
Mahmood Ahmadi, Stephan Wong
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
13 years 10 months ago
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
Jérôme Monnot
ICIAP
2005
ACM
14 years 4 months ago
Track Matching by Major Color Histograms Matching and Post-matching Integration
Abstract. In this paper we present a track matching algorithm based on the "major color" histograms matching and the post-matching integration useful for tracking a singl...
Eric Dahai Cheng, Massimo Piccardi
VLDB
2004
ACM
120views Database» more  VLDB 2004»
13 years 10 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...