Sciweavers

66 search results - page 7 / 14
» Finding Graph Matchings in Data Streams
Sort
View
ICWS
2008
IEEE
13 years 11 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 10 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
CVPR
2008
IEEE
14 years 11 months ago
Matching non-rigidly deformable shapes across images: A globally optimal solution
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
Thomas Schoenemann, Daniel Cremers
ASUNAM
2010
IEEE
13 years 11 months ago
COSI: Cloud Oriented Subgraph Identification in Massive Social Networks
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
13 years 10 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi