Sciweavers

1493 search results - page 141 / 299
» Local resilience of graphs
Sort
View
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
14 years 1 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
ICASSP
2010
IEEE
13 years 8 months ago
Bridge detection and robust geodesics estimation via random walks
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
Eugene Brevdo, Peter J. Ramadge
IJON
2006
103views more  IJON 2006»
13 years 8 months ago
Kernel extrapolation
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
S. V. N. Vishwanathan, Karsten M. Borgwardt, Omri ...
PR
2006
131views more  PR 2006»
13 years 8 months ago
A face recognition system based on automatically determined facial fiducial points
In this paper a completely automatic face recognition system is presented. The method works on color images: after having localized the face and the facial features, it determines...
Stefano Arca, Paola Campadelli, Raffaella Lanzarot...
CVPR
2003
IEEE
14 years 10 months ago
Object Segmentation Using Graph Cuts Based Active Contours
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
Ning Xu, Ravi Bansal, Narendra Ahuja