Sciweavers

192 search results - page 18 / 39
» Cut Points in PEG
Sort
View
IMAMS
2007
115views Mathematics» more  IMAMS 2007»
14 years 11 months ago
Segmenting Periodic Reliefs on Triangle Meshes
Decorative reliefs are widely used for e.g. packaging and porcelain design. In periodic reliefs, the relief repeats a pattern, for example all the way around an underlying surface...
Shenglan Liu, Ralph R. Martin, Frank C. Langbein, ...
75
Voted
BMCBI
2004
87views more  BMCBI 2004»
14 years 9 months ago
Selection of informative clusters from hierarchical cluster tree with gene classes
Background: A common clustering method in the analysis of gene expression data has been hierarchical clustering. Usually the analysis involves selection of clusters by cutting the...
Petri Törönen
99
Voted
ICPR
2008
IEEE
15 years 10 months ago
Multiclass spectral clustering based on discriminant analysis
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
Xi Li, Zhongfei Zhang, Yanguo Wang, Weiming Hu
SIAMJO
2010
79views more  SIAMJO 2010»
14 years 8 months ago
Theta Bodies for Polynomial Ideals
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
João Gouveia, Pablo A. Parrilo, Rekha R. Th...
SIAMDM
2011
14 years 4 months ago
On Maximal S-Free Convex Sets
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
Diego A. Morán R., Santanu S. Dey