Sciweavers

268 search results - page 31 / 54
» Cleaning Interval Graphs
Sort
View
78
Voted
ISCAS
2008
IEEE
139views Hardware» more  ISCAS 2008»
15 years 4 months ago
Missing feature speech recognition in a meeting situation with maximum SNR beamforming
Abstract— Especially for tasks like automatic meeting transcription, it would be useful to automatically recognize speech also while multiple speakers are talking simultaneously....
Dorothea Kolossa, Shoko Araki, Marc Delcroix, Tomo...
ICDE
2011
IEEE
281views Database» more  ICDE 2011»
14 years 1 months ago
Declarative analysis of noisy information networks
—There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data ...
Walaa Eldin Moustafa, Galileo Namata, Amol Deshpan...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 10 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 8 months ago
Learning Networks of Stochastic Differential Equations
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
José Bento, Morteza Ibrahimi, Andrea Montan...
LCPC
2009
Springer
15 years 2 months ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati