Sciweavers

1226 search results - page 185 / 246
» On Conditions for Linearity of Optimal Estimation
Sort
View
APLAS
2005
ACM
15 years 3 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
ICIP
2005
IEEE
15 years 11 months ago
An articulated registration method
This paper introduces a new registration method estimating the displacement field of bodies which deformations are constrained by an articulated rigid body. We propose an articula...
Aloys du Bois d'Aische, Mathieu De Craene, Beno&ic...
ICML
2009
IEEE
15 years 10 months ago
Learning dictionaries of stable autoregressive models for audio scene analysis
In this paper, we explore an application of basis pursuit to audio scene analysis. The goal of our work is to detect when certain sounds are present in a mixed audio signal. We fo...
Youngmin Cho, Lawrence K. Saul
ICML
2007
IEEE
15 years 10 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
CP
2009
Springer
15 years 10 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey