Sciweavers

1068 search results - page 36 / 214
» On Space Bounded Server Algorithms
Sort
View
ESORICS
2004
Springer
14 years 1 months ago
Portable and Flexible Document Access Control Mechanisms
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). ...
Mikhail J. Atallah, Marina Bykova
POPL
2003
ACM
14 years 8 months ago
Static prediction of heap space usage for first-order functional programs
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 ...
Martin Hofmann, Steffen Jost
INFOCOM
2009
IEEE
14 years 2 months ago
Greedy Routing with Bounded Stretch
—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...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
JC
2007
109views more  JC 2007»
13 years 7 months ago
Cubature formulas for function spaces with moderate smoothness
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...
Michael Gnewuch, René Lindloh, Reinhold Sch...
MASCOTS
2008
13 years 9 months ago
Finding Good Configurations in High-Dimensional Spaces: Doing More with Less
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 ...
Risi Thonangi, Vamsidhar Thummala, Shivnath Babu