Sciweavers

378 search results - page 20 / 76
» How Many Ways Can One Draw a Graph
Sort
View
120
Voted
ICWS
2008
IEEE
15 years 5 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
118
Voted
MLG
2007
Springer
15 years 9 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
141
Voted
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 4 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
177
Voted
ECCV
2008
Springer
16 years 5 months ago
Star Shape Prior for Graph-Cut Image Segmentation
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...
Olga Veksler
115
Voted
IWMM
2000
Springer
137views Hardware» more  IWMM 2000»
15 years 7 months ago
Cycles to Recycle: Garbage Collection on the IA-64
The IA-64, Intel's 64-bit instruction set architecture, exhibits a number of interesting architectural features. Here we consider those features as they relate to supporting ...
Richard L. Hudson, J. Eliot B. Moss, Sreenivas Sub...