Sciweavers

WSC
2004
13 years 11 months ago
Retrospective Approximation Algorithms for the Multidimensional Stochastic Root-Finding Problem
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
Raghu Pasupathy, Bruce W. Schmeiser
WSCG
2001
90views more  WSCG 2001»
13 years 11 months ago
Photo-Realistic Simulation and Rendering of Halos
We present a technique for efficiently generating photo-realistic pictures of halos and inserting them into existing photographs. First, we describe an algorithm for producing ima...
Jean-Christophe Gonzato, Sylvain Marchand
UAI
2004
13 years 11 months ago
On-line Prediction with Kernels and the Complexity Approximation Principle
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
Alexander Gammerman, Yuri Kalnishkan, Vladimir Vov...
VMV
2001
91views Visualization» more  VMV 2001»
13 years 11 months ago
A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes
When using triangle meshes in numerical simulations or other sophisticated downstream applications, we have to guarantee that no degenerate faces are present since they have, e.g....
Mario Botsch, Leif Kobbelt
VIP
2001
13 years 11 months ago
Newspaper Document Analysis Featuring Connected Line Segmentation
This paper presents an algorithm designed to segment and classify newspaper documents. A notable feature of this algorithm is the ability to detect lines in the document
Phillip E. Mitchell, Hong Yan
SODA
2004
ACM
74views Algorithms» more  SODA 2004»
13 years 11 months ago
Torpid mixing of simulated tempering on the Potts model
Simulated tempering and swapping are two families of sampling algorithms in which a parameter representing temperature varies during the simulation. The hope is that this will ove...
Nayantara Bhatnagar, Dana Randall
UAI
2001
13 years 11 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
IJCAI
2003
13 years 11 months ago
DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks
We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate ...
Austin I. Eliazar, Ronald Parr
IJCAI
2003
13 years 11 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
IJCAI
2003
13 years 11 months ago
A Learning Algorithm for Web Page Scoring Systems
Hyperlink analysis is a successful approach to define algorithms which compute the relevance of a document on the basis of the citation graph. In this paper we propose a technique...
Michelangelo Diligenti, Marco Gori, Marco Maggini