Sciweavers

388 search results - page 9 / 78
» Reconstructing Many Partitions Using Spectral Techniques
Sort
View
VISUALIZATION
2000
IEEE
13 years 12 months ago
New techniques for topologically correct surface reconstruction
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
Udo Adamy, Joachim Giesen, Matthias John
ICASSP
2011
IEEE
12 years 11 months ago
Investigations into the incorporation of the Ideal Binary Mask in ASR
While much work has been dedicated to exploring how best to incorporate the Ideal Binary Mask (IBM) in automatic speech recognition (ASR) for noisy signals, we demonstrate that th...
William Hartmann, Eric Fosler-Lussier
ASPDAC
2000
ACM
109views Hardware» more  ASPDAC 2000»
13 years 11 months ago
A technique for QoS-based system partitioning
Quality of service (QoS) has been an important topic of many research communities. Combined with an advanced and retargetable compiler, variability of applicationsspecific very lar...
Johnson S. Kin, Chunho Lee, William H. Mangione-Sm...
PR
2008
169views more  PR 2008»
13 years 7 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
IJON
2008
116views more  IJON 2008»
13 years 7 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter