4201 search results - page 178 / 841 » Interaction graphs: Additives |
124
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
113
Voted
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
158
click to vote
3DPVT
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
139
Voted
ALENEX
2004
15 years 6 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
144
Voted
IJCAI
2003
15 years 6 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...