7129 search results - page 1091 / 1426 » Approximation Algorithms for Treewidth |
137
click to vote
GRAPHICSINTERFACE
2008
15 years 5 months ago
2008
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...
133
Voted
ICVGIP
2008
15 years 5 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...
132
Voted
NIPS
2007
15 years 5 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 ...
143
click to vote
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
124
Voted
AAMAS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...