Sciweavers

5864 search results - page 247 / 1173
» Can We Work around Numerical Methods
Sort
View
RC
2002
72views more  RC 2002»
15 years 5 months ago
Symbolic Preconditioning with Taylor Models: Some Examples
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
R. Baker Kearfott, G. William Walster
SCALESPACE
2009
Springer
16 years 21 days ago
A Scale-Space Approach to Landmark Constrained Image Registration
Adding external knowledge improves the results for ill-posed problems. In this paper we present a new multi-level optimization framework for image registration when adding landmark...
Eldad Haber, Stefan Heldmann, Jan Modersitzki
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 11 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 7 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
CVPR
2007
IEEE
16 years 8 months ago
Kinematics from Lines in a Single Rolling Shutter Image
Recent work shows that recovering pose and velocity from a single view of a moving rigid object is possible with a rolling shutter camera, based on feature point correspondences. ...
Omar Ait-Aider, Adrien Bartoli, Nicolas Andreff