Sciweavers

3220 search results - page 189 / 644
» Constrained Graph Processes
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Downsampling graphs using spectral theory
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
Sunil K. Narang, Antonio Ortega
WG
2004
Springer
15 years 11 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
ENTCS
2006
168views more  ENTCS 2006»
15 years 6 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
MICCAI
2003
Springer
16 years 7 months ago
User-Defined B-Spline Template-Snakes
We combine a new user initialization process with a B-spline snake to create a model with the properties of a deformable template. This `template' snake can be constrained by ...
Tim McInerney, Hoda Dehmeshki
ICASSP
2009
IEEE
16 years 1 months ago
Minimum variance modulation filter for robust speech recognition
This paper describes a way of designing modulation filter by datadriven analysis which improves the performance of automatic speech recognition systems that operate in real envir...
Yu-Hsiang Bosco Chiu, Richard M. Stern