8431 search results - page 1560 / 1687 » Algorithmically Independent Sequences |
117
Voted
ICVGIP
2008
15 years 3 months ago
2008
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
117
click to vote
NIPS
2007
15 years 3 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
118
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
153
Voted
COLING
1992
15 years 3 months ago
1992
This paper proposes a two-phase example-based machine translation methodology which develops translation templates from examples and then translates using template matching. This ...
124
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...