Sciweavers

507 search results - page 47 / 102
» Structural Matching of BPEL Processes
Sort
View
CVPR
2012
IEEE
12 years 6 days ago
Robust non-rigid registration of 2D and 3D graphs
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
Eduard Serradell, Przemyslaw Glowacki, Jan Kybic, ...
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
14 years 3 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
IFIPTCS
2010
13 years 7 months ago
Concurrent Pattern Calculus
Abstract. Concurrent pattern calculus drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising fro...
Thomas Given-Wilson, Daniele Gorla, Barry Jay
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
12 years 6 days ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 10 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...