Sciweavers

52 search results - page 4 / 11
» Representable Disjoint NP-Pairs
Sort
View
INTERSPEECH
2010
13 years 3 months ago
Sparse component analysis for speech recognition in multi-speaker environment
Sparse Component Analysis is a relatively young technique that relies upon a representation of signal occupying only a small part of a larger space. Mixtures of sparse components ...
Afsaneh Asaei, Hervé Bourlard, Philip N. Ga...
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
14 years 9 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
INFOCOM
2007
IEEE
14 years 3 months ago
Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
Alexander Sprintson, Marcelo Yannuzzi, Ariel Orda,...
ICIP
2005
IEEE
14 years 10 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
SIGGRAPH
1992
ACM
14 years 25 days ago
Interactive inspection of solids: cross-sections and interferences
To reduce the cost of correcting design errors, assemblies of mechanical parts are modeled using CAD systems and verified electronically before the designs are sent to manufacturi...
Jarek Rossignac, Abe Megahed, Bengt-Olaf Schneider