1068 search results - page 56 / 214 » On Space Bounded Server Algorithms |
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
UIST
2000
ACM
15 years 2 months ago
2000
ACM
We present a general approach to the dynamic representation of 2D space that is well suited for userinterface layout. We partition space into two distinct categories: full and emp...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
PODS
2004
ACM
15 years 10 months ago
2004
ACM
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...