6110 search results - page 767 / 1222 » Approximate Computing |
155
click to vote
IJCAI
1997
15 years 8 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
174
click to vote
IJCV
2007
15 years 6 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
225
click to vote
UPP
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
216
click to vote
CGF
2011
14 years 10 months ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
182
click to vote
MICCAI
2002
Springer
16 years 7 months ago
2002
Springer
Most existing methods for registration of three-dimensional tomographic images to two-dimensional projection images use simulated projection images and either intensity-based or fe...