Sciweavers

1484 search results - page 78 / 297
» Ants meeting algorithms
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
ICMI
2005
Springer
215views Biometrics» more  ICMI 2005»
14 years 3 months ago
Multimodal multispeaker probabilistic tracking in meetings
Tracking speakers in multiparty conversations constitutes a fundamental task for automatic meeting analysis. In this paper, we present a probabilistic approach to jointly track th...
Daniel Gatica-Perez, Guillaume Lathoud, Jean-Marc ...
LCPC
2009
Springer
14 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
MOBIHOC
2006
ACM
14 years 9 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
EDBT
1990
ACM
108views Database» more  EDBT 1990»
14 years 2 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo