2497 search results - page 459 / 500 » Requirements for models of achievable routing |
161
click to vote
CHI
2005
ACM
16 years 6 months ago
2005
ACM
We are rapidly moving toward a world where personal networked video cameras are ubiquitous. Already, camera-equipped cell phones are becoming commonplace. Imagine being able to ta...
156
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
117
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
166
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
To fully exploit multicore processors, applications are expected to provide a large degree of thread-level parallelism. While adequate for low core counts and their typical worklo...
180
click to vote
HPDC
2009
IEEE
16 years 28 days ago
2009
IEEE
This article deals with TakTuk, a middleware that deploys efficiently parallel remote executions on large scale grids (thousands of nodes). This tool is mostly intended for intera...