1068 search results - page 108 / 214 » On Space Bounded Server Algorithms |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
As XML-based messages have become common in many client-server protocols, there is a need to protect application servers from invalid or dangerous messages. This leads to the XML ...
INFOCOM
1998
IEEE
14 years 3 days ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...