166 search results - page 22 / 34 » Tighter Bounds for Structured Estimation |
CAD
2000
Springer
13 years 9 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
DAGSTUHL
2003
13 years 11 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...