3825 search results - page 115 / 765 » More on pooling spaces |
MHCI
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a novel idea for a system known as Telelogs. Utilizing the ubiquity of mobile devices, Telelogs functions as a service by which individuals in an urban environ...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
CGO
2003
IEEE
15 years 3 months ago
2003
IEEE
To meet the performance demands of modern architectures, compilers incorporate an everincreasing number of aggressive code transformations. Since most of these transformations are...
104
click to vote
TAMC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...