2485 search results - page 292 / 497 » Time Bounded Frequency Computations |
AIPS
2006
13 years 9 months ago
2006
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
ECCC
2010
13 years 6 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
ICALP
1992
Springer
14 years 9 days ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
SI3D
2003
ACM
14 years 1 months ago
2003
ACM
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...