Sciweavers

2911 search results - page 177 / 583
» A Logic of Graph Constraints
Sort
View
100
Voted
ESOP
2004
Springer
15 years 6 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
99
Voted
JLP
2006
81views more  JLP 2006»
15 years 25 days ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
118
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 29 days ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
97
Voted
ICML
2005
IEEE
16 years 1 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
93
Voted
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
15 years 7 months ago
A graph theoretic approach to optimal target tracking for mobile robot teams
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
Jason C. Derenick, John R. Spletzer, M. Ani Hsieh