4865 search results - page 322 / 973 » The Complexity of Graph Connectivity |
172
click to vote
IPL
2011
15 years 1 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
203
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
182
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
185
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
153
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the stiffness matrices of 2-dimensional truss structure...