Sciweavers

1940 search results - page 165 / 388
» Graph Transformation with Variables
Sort
View
142
Voted
ENDM
2010
101views more  ENDM 2010»
15 years 3 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
PAA
2006
15 years 3 months ago
Classifying image texture with statistical landscape features
This paper proposes to use three-dimensional information derived from the graph of an image function for texture description. The graph of an image function is a rumpled surface ap...
Cun Xu, Yan Chen
94
Voted
IWPC
2010
IEEE
15 years 2 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy
137
Voted
AVBPA
2003
Springer
106views Biometrics» more  AVBPA 2003»
15 years 8 months ago
A Face Recognition System Based on Local Feature Analysis
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...
Stefano Arca, Paola Campadelli, Raffaella Lanzarot...
106
Voted
COMBINATORICS
2006
112views more  COMBINATORICS 2006»
15 years 3 months ago
More Forbidden Minors for Wye-Delta-Wye Reducibility
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
Yaming Yu