2095 search results - page 270 / 419 » Improved pebbling bounds |
188
click to vote
CODES
2005
IEEE
16 years 10 days ago
2005
IEEE
We present a new scheme for dynamic voltage and frequency scaling (DVS) for processing multimedia streams on architectures with restricted buffer sizes. The main advantage of our ...
164
click to vote
INFOCOM
2005
IEEE
16 years 9 days ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
200
click to vote
GD
2004
Springer
16 years 3 days ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
153
click to vote
PODC
2003
ACM
15 years 12 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
176
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...