Sciweavers

2127 search results - page 62 / 426
» Computing large matchings fast
Sort
View
156
Voted
ACL
2008
15 years 5 months ago
Pairwise Document Similarity in Large Collections with MapReduce
This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to de...
Tamer Elsayed, Jimmy J. Lin, Douglas W. Oard
129
Voted
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
15 years 10 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
128
Voted
ANCS
2007
ACM
15 years 7 months ago
Frame-aggregated concurrent matching switch
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
Bill Lin, Isaac Keslassy
133
Voted
ICIP
2001
IEEE
16 years 5 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
DAC
2007
ACM
16 years 4 months ago
Compact State Machines for High Performance Pattern Matching
Pattern matching is essential to a wide range of applications such as network intrusion detection, virus scanning, etc. Pattern matching algorithms normally rely on state machines...
Piti Piyachon, Yan Luo