Sciweavers

10901 search results - page 344 / 2181
» Approximations in Distributed Optimization
Sort
View
RT
1999
Springer
15 years 11 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool
FORTE
2004
15 years 8 months ago
How Synchronisation Strategy Approximation in PEPA Implementations Affects Passage Time Performance Results
Passage time densities are useful performance measurements in stochastic systems. With them the modeller can extract probabilistic quality-of-service guarantees such as: the proba...
Jeremy T. Bradley, Stephen T. Gilmore, Nigel Thoma...
COLING
2002
15 years 6 months ago
A Novel Disambiguation Method for Unification-Based Grammars Using Probabilistic Context-Free Approximations
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
Bernd Kiefer, Hans-Ulrich Krieger, Detlef Prescher
CORR
2011
Springer
153views Education» more  CORR 2011»
15 years 1 months ago
Partially Linear Bayesian Estimation with Application to Sparse Approximations
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
Tomer Michaeli, Daniel Sigalov, Yonina C. Eldar
AAAI
2011
14 years 6 months ago
Lossy Conservative Update (LCU) Sketch: Succinct Approximate Count Storage
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
Amit Goyal, Hal Daumé III