Sciweavers

1333 search results - page 77 / 267
» Not a Number of Floating Point Problems
Sort
View
COMPGEOM
2004
ACM
15 years 9 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
119
Voted
AAAI
2007
15 years 5 months ago
UNDERTOW: Multi-Level Segmentation of Real-Valued Time Series
The discovery of meaningful change points, finding segments, in both categorical and real-value data time series is a well-studied problem. Prior segmentation algorithms and task...
Tom Armstrong, Tim Oates
116
Voted
BMVC
2000
15 years 5 months ago
Parallel Chains, Delayed Rejection and Reversible Jump MCMC for Object Recognition
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
M. Harkness, P. Green
129
Voted
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 3 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
144
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat