1127 search results - page 180 / 226 » Testing the Expansion of a Graph |
HIS
2009
14 years 7 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
CAP
2010
14 years 4 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
JMLR
2010
14 years 4 months ago
2010
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
TGIS
2010
14 years 4 months ago
2010
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
100
click to vote
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small...