Sciweavers

9949 search results - page 1874 / 1990
» On the Network Complexity of Selection
Sort
View
TON
2010
176views more  TON 2010»
13 years 3 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten

Publication
266views
13 years 2 months ago
NeuFlow: A Runtime Reconfigurable Dataflow Processor for Vision
In this paper we present a scalable dataflow hard- ware architecture optimized for the computation of general- purpose vision algorithms—neuFlow—and a dataflow compiler—luaFl...
C. Farabet, B. Martini, B. Corda, P. Akselrod, E. ...
ICASSP
2011
IEEE
13 years 20 days ago
Fast estimation of the state of the power grid using synchronized phasor measurements
—Both the communication limitation and the measurement properties based algorithm become the bottleneck of enhancing the traditional power system state estimation speed. The avai...
Tao Yang, Anjan Bose
ICASSP
2011
IEEE
13 years 19 days ago
Proportionate affine projection sign algorithms for sparse system identification in impulsive interference
Two proportionate af ne projection sign algorithms (APSAs) are proposed for system identi cation applications, such as network echo cancellation (NEC), where the impulse response ...
Zengli Yang, Yahong Rosa Zheng, Steven L. Grant
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
13 years 19 days ago
SQPR: Stream query planning with reuse
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hi...
« Prev « First page 1874 / 1990 Last » Next »