Sciweavers

829 search results - page 53 / 166
» Distance domination-critical graphs
Sort
View
62
Voted
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 5 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
ISVC
2009
Springer
15 years 4 months ago
Graph Cut Based Point-Cloud Segmentation for Polygonal Reconstruction
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. Thi...
David Sedlacek, Jiri Zara
DAM
2010
105views more  DAM 2010»
14 years 9 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...
ICASSP
2008
IEEE
15 years 6 months ago
Probabilistic framework for gene expression clustering validation based on gene ontology and graph theory
Based on the correlation between expression and ontologydriven gene similarity, we incorporate functional annotations into gene expression clustering validation. A probabilistic f...
Yinyin Yuan, Chang-Tsun Li
CVPR
2007
IEEE
15 years 6 months ago
Conformal Embedding Analysis with Local Graph Modeling on the Unit Hypersphere
We present the Conformal Embedding Analysis (CEA) for feature extraction and dimensionality reduction. Incorporating both conformal mapping and discriminating analysis, CEA projec...
Yun Fu, Ming Liu, Thomas S. Huang