Sciweavers

507 search results - page 24 / 102
» Structural Matching of BPEL Processes
Sort
View
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 9 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
MMM
2007
Springer
139views Multimedia» more  MMM 2007»
14 years 2 months ago
An Image Registration Method Based on the Local and Global Structures
We propose a novel feature-based image registration method using both the local and global structures of the feature points. To address various imaging conditions, we improve the l...
Nan Peng, Zhiyong Huang, Zujun Hou
NGC
2006
Springer
135views Communications» more  NGC 2006»
13 years 8 months ago
Seeing Things: Inventive Reasoning with Geometric Analogies and Topographic Maps
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic (landcover) maps. We present a Structure Matchin...
Diarmuid P. O'Donoghue, Amy J. Bohan, Mark T. Kean...
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
14 years 6 days ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
COLING
1996
13 years 9 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer