1068 search results - page 36 / 214 » On Space Bounded Server Algorithms |
145
click to vote
ESORICS
2004
Springer
15 years 9 months ago
2004
Springer
We present and analyze portable access control mechanisms for large data repositories, in that the customized access policies are stored on a portable device (e.g., a smart card). ...
221
Voted
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
136
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
119
click to vote
JC
2007
15 years 3 months ago
2007
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...
126
click to vote
MASCOTS
2008
15 years 5 months ago
2008
Manually tuning tens to hundreds of configuration parameters in a complex software system like a database or an application server is an arduous task. Recent work has looked into ...