Sciweavers

157 search results - page 9 / 32
» Compact representations of separable graphs
Sort
View
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
13 years 11 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
TASLP
2008
123views more  TASLP 2008»
13 years 7 months ago
Normalized Cuts for Predominant Melodic Source Separation
The predominant melodic source, frequently the singing voice, is an important component of musical signals. In this paper, we describe a method for extracting the predominant sourc...
Mathieu Lagrange, Luis Gustavo Martins, Jennifer M...
IDMS
1998
Springer
122views Multimedia» more  IDMS 1998»
13 years 11 months ago
Object Graphs as Pivotal Representations for Hypermedia
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...
Marc Brelot, Gilles Privat
ICPR
2008
IEEE
14 years 8 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
ICPR
2010
IEEE
14 years 3 days ago
Face Recognition Using a Multi-Manifold Discriminant Analysis Method
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
Wankou Yang, Changyin Sun, Lei Zhang