1127 search results - page 122 / 226 » Value Compression for Efficient Computation |
AAAI
2010
14 years 11 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
It is well known that the base composition along eukaryotic genomes is long-range correlated. Here, we investigate the effect of such long-range correlations on alignment score sta...
CVPR
1999
IEEE
15 years 2 months ago
1999
IEEE
We formulate stereo matching as an extremal surface extraction problem. This is made possible by embedding the disparity surface inside a volume where the surface is composed of v...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
In most cases when information is to be extracted from an image, there are priors available on the state of the world and therefore on the detailed measurements which will be obta...