218 search results - page 13 / 44 » Local Properties of Triangular Graphs |
123
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
An empirical study is performed on the local-optimum space of graph bipartitioning. We examine some statistical features of the fitness landscape. They include the cost-distance c...
158
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
196
click to vote
SGP
2004
15 years 8 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
206
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
179
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...