Sciweavers

828 search results - page 99 / 166
» Simplicial Powers of Graphs
Sort
View
SC
2003
ACM
14 years 27 days ago
Synthesizing Realistic Computational Grids
Realistic workloads are essential in evaluating middleware for computational grids. One important component is the raw grid itself: a network topology graph annotated with the har...
Dong Lu, Peter A. Dinda
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 22 days ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
WCRE
1993
IEEE
13 years 11 months ago
Flexible Control for Program Recognition
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
Linda M. Wills
CONCURRENCY
2006
112views more  CONCURRENCY 2006»
13 years 7 months ago
Implementing BPEL4WS: the architecture of a BPEL4WS implementation
e a set of very distinctive abstractions that result in significant modifications of the basic workflow model as outlined in pre-existing workflow model, see [2] for example. In pa...
Francisco Curbera, Rania Khalaf, William Nagy, San...
PR
2006
152views more  PR 2006»
13 years 7 months ago
Edit distance-based kernel functions for structural pattern classification
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we i...
Michel Neuhaus, Horst Bunke