Sciweavers

234 search results - page 41 / 47
» Isolation, Matching, and Counting
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 1 days ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
IJCNN
2008
IEEE
15 years 6 months ago
Learning to select relevant perspective in a dynamic environment
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...
Zhihui Luo, David A. Bell, Barry McCollum, Qingxia...
GLOBECOM
2006
IEEE
15 years 5 months ago
A Practical Switch-Memory-Switch Architecture Emulating PIFO OQ
— Emulating Output Queued (OQ) Switch with sustainable implementation cost and low fixed delay is always preferable in designing high performance routers. The SwitchMemory-Switch...
Nan Hua, Yang Xu, Peng Wang, Depeng Jin, Lieguang ...
VEE
2006
ACM
178views Virtualization» more  VEE 2006»
15 years 5 months ago
Impact of virtual execution environments on processor energy consumption and hardware adaptation
During recent years, microprocessor energy consumption has been surging and efforts to reduce power and energy have received a lot of attention. At the same time, virtual executio...
Shiwen Hu, Lizy Kurian John
INFOCOM
2002
IEEE
15 years 4 months ago
Guaranteed Scheduling for Switches with Configuration Overhead
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
Brian Towles, William J. Dally