Sciweavers

88 search results - page 17 / 18
» Efficient Randomized Algorithms for Input-Queued Switch Sche...
Sort
View
ICC
1997
IEEE
158views Communications» more  ICC 1997»
15 years 6 months ago
The Priority Token Bank in a Network of Queues
This paper takes a known approach for scheduling and admission control in integrated services networks1 , the Priority Token Bank (PTB), whose mechanism and performance have been ...
Mark A. Lynn, Jon M. Peha
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
15 years 10 months ago
High-level synthesis challenges and solutions for a dynamically reconfigurable processor
A dynamically reconfigurable processor (DRP) is designed to achieve high area efficiency by switching reconfigurable data paths dynamically. Our DRP architecture has a stand alone...
Takao Toi, Noritsugu Nakamura, Yoshinosuke Kato, T...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 1 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
123
Voted
ICIP
2003
IEEE
16 years 3 months ago
Audio-visual speaker tracking with importance particle filters
We present a probabilistic method for audio-visual (AV) speaker tracking, using an uncalibrated wide-angle camera and a microphone array. The algorithm fuses 2-D object shape and ...
Daniel Gatica-Perez, Guillaume Lathoud, Iain McCow...
EWSN
2009
Springer
16 years 2 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...