Sciweavers

1536 search results - page 65 / 308
» Approximately Dominating Representatives
Sort
View
ICML
2002
IEEE
16 years 20 days ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
15 years 8 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
KESAMSTA
2009
Springer
15 years 6 months ago
An Approximate Model for Bidders in Sequential Automated Auctions
In this paper, we propose a probabilistic model to study the interaction of bidder and seller agents in sequential automated auctions. We consider a designated “special bidder”...
Erol Gelenbe, Kumaara Velan
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
15 years 6 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
SMI
2008
IEEE
15 years 6 months ago
Polygonizing skeletal sheets of CT-scanned objects by partitioin of unity approximations
The skeletal structures of solid objects play an important role in medical and industrial applications. Given a volumetrically sampled solid object, our method extracts a nice-loo...
Yukie Nagai, Yutaka Ohtake, Kiwamu Kase, Hiromasa ...