Sciweavers

73 search results - page 9 / 15
» Projective-planar signed graphs and tangled signed graphs
Sort
View
IJAC
2010
96views more  IJAC 2010»
13 years 4 months ago
Coxeter Covers of the Classical Coxeter Groups
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
Meirav Amram, Robert Shwartz, Mina Teicher
ICIP
2002
IEEE
14 years 9 months ago
Advanced animation framework for virtual character within the MPEG-4 standard
This paper presents an advanced animation framework for virtual character within the MPEG-4 standard. The Bonebased Animation (BBA) specifications are described and it is shown ho...
Françoise J. Prêteux, Marius Preda

Publication
592views
15 years 3 months ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng
DM
2008
112views more  DM 2008»
13 years 7 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
IPMI
2005
Springer
14 years 8 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...