1068 search results - page 37 / 214 » On Space Bounded Server Algorithms |
NIPS
2004
13 years 9 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
IPL
2002
13 years 7 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
We show that for every n-dimensional lattice L the torus Rn /L can be embedded with distortion O(n
PODS
2009
ACM
14 years 8 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...