Sciweavers

933 search results - page 152 / 187
» Monotone Complexity of a Pair
Sort
View
TALG
2010
73views more  TALG 2010»
13 years 7 months ago
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
Omid Madani, Mikkel Thorup, Uri Zwick
BMVC
2010
13 years 6 months ago
Manifold Alignment via Corresponding Projections
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets...
Deming Zhai, Bo Li, Hong Chang, Shiguang Shan, Xil...
CASES
2010
ACM
13 years 6 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
ICIP
2010
IEEE
13 years 6 months ago
Non-rigid image registration by using graph-cuts with mutual information
Non-rigid image registration plays an important role in medical image analysis. Recently, Tang and Chung proposed to model the non-rigid medical image registration problem as an e...
Ronald W. K. So, Albert C. S. Chung
IFIPTCS
2010
13 years 6 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...