Sciweavers

736 search results - page 32 / 148
» Distinguishing geometric graphs
Sort
View
SMA
2003
ACM
14 years 1 months ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang
DCG
2011
13 years 3 months ago
Random Geometric Complexes
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
Matthew Kahle
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
14 years 1 months ago
Spectral analysis of virus spreading in random geometric networks
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
Victor M. Preciado, Ali Jadbabaie
AVBPA
2005
Springer
279views Biometrics» more  AVBPA 2005»
14 years 2 months ago
On Combining Textural and Geometrical Scores for Discriminative Face Authentication
Abstract. In this paper, a combined shape-texture approach to discriminative face authentication is studied. Facial texture information is captured through Gabor responses (jets), ...
José Luis Alba-Castro, Daniel Gonzál...
DM
2010
126views more  DM 2010»
13 years 8 months ago
Asymptotic connectivity of hyperbolic planar graphs
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
Patrick Bahls, Michael R. Dipasquale