Sciweavers

1883 search results - page 122 / 377
» Ordered theta graphs
Sort
View
CAV
2006
Springer
146views Hardware» more  CAV 2006»
13 years 11 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
ICWS
2007
IEEE
13 years 9 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni
NIPS
2004
13 years 9 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
Pascal O. Vontobel
CSJM
2006
76views more  CSJM 2006»
13 years 8 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru