6105 search results - page 819 / 1221 » A Parallel Algorithm for Bound-Smoothing |
168
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
164
click to vote
AAAI
2004
15 years 8 months ago
2004
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
180
click to vote
VMV
2001
15 years 8 months ago
2001
Virtual view synthesis is essential for 3D teleconference systems like VIRTUE, which utilizes the motion parallax cue. In this paper we propose a multi-step view synthesis algorit...
140
click to vote
AAAI
1998
15 years 8 months ago
1998
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
174
click to vote
AIPS
1994
15 years 8 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...