Sciweavers

1612 search results - page 19 / 323
» Asynchronous Pattern Matching
Sort
View
96
Voted
CVPR
2010
IEEE
15 years 1 months ago
Fast pattern matching using orthogonal Haar transform
Pattern matching is a widely used procedure in signal processing, computer vision, image and video processing. Recently, methods using Walsh Hadamard Transform (WHT) and Gray-Code...
Wanli Ouyang, Renqi Zhang, Cham Wai-Kuen
CVPR
2008
IEEE
15 years 11 months ago
Detecting and matching repeated patterns for automatic geo-tagging in urban environments
We present a novel method for automatically geo-tagging photographs of man-made environments via detection and matching of repeated patterns. Highly repetitive environments introd...
Grant Schindler, Panchapagesan Krishnamurthy, Robe...
ICALP
1998
Springer
15 years 1 months ago
A Hierarchy of Equivalences for Asynchronous Calculi
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
Cédric Fournet, Georges Gonthier
BALT
2010
14 years 4 months ago
Bringing Domain Knowledge to Pattern Matching
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
Agris Sostaks
74
Voted
PVLDB
2010
129views more  PVLDB 2010»
14 years 8 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...