Sciweavers

1188 search results - page 54 / 238
» Extended Graph Unification
Sort
View
121
Voted
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
15 years 7 months ago
Discrete Regularization for Perceptual Image Segmentation via Semi-Supervised Learning and Optimal Control
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Hongwei Zheng, Olaf Hellwich
110
Voted
CAAN
2007
Springer
15 years 7 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
118
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 27 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...
123
Voted
JGAA
1998
116views more  JGAA 1998»
15 years 14 days ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
114
Voted
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
14 years 11 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia