488 search results - page 69 / 98 » Automorphic Decompositions of Graphs |
146
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
111
click to vote
SOCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
123
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We propose in this paper a robust multi-resolution technique to estimate dense velocity field from image sequences. It couples a Gaussian pyramidal down-sampling decomposition to...
120
click to vote
DMSN
2004
ACM
15 years 8 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
176
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...