Sciweavers

3123 search results - page 95 / 625
» Focusing on pattern matching
Sort
View
PAMI
2007
125views more  PAMI 2007»
14 years 9 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
IS
2006
14 years 9 months ago
A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
Li Xu, David W. Embley
ICPP
2009
IEEE
14 years 7 months ago
Mediacoop: Hierarchical Lookup for P2P-VoD Services
The random seeking in P2P-VoD system requires efficient lookup for "good" suppliers. The main challenge is that good suppliers should meet two requirements: "conten...
Tieying Zhang, Jianming Lv, Xueqi Cheng
FPGA
2009
ACM
285views FPGA» more  FPGA 2009»
15 years 4 months ago
PERG-Rx: a hardware pattern-matching engine supporting limited regular expressions
PERG is a pattern matching engine designed for locating predefined byte string patterns (rules) from the ClamAV virus signature database in a data stream. This paper presents PERG...
Johnny Tsung Lin Ho, Guy G. Lemieux
LREC
2008
90views Education» more  LREC 2008»
14 years 11 months ago
Navigating through Dense Annotation Spaces
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...
Branimir Boguraev, Mary S. Neff