Sciweavers

453 search results - page 25 / 91
» Tight bounds for the partial-sums problem
Sort
View
IPPS
1999
IEEE
14 years 23 days ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
SCALESPACE
2007
Springer
14 years 2 months ago
Bounds on the Minimizers of (nonconvex) Regularized Least-Squares
This is a theoretical study on the minimizers of cost-functions composed of an ℓ2 data-fidelity term and a possibly nonsmooth or nonconvex regularization term acting on the di...
Mila Nikolova
HYBRID
2000
Springer
14 years 2 days ago
Ellipsoidal Techniques for Reachability Analysis
For the reach tube of a linear time-varying system with ellipsoidal bounds on the control variable consider the following approximation problem. Find a tight ellipsoid-valued tube...
Alexander B. Kurzhanski, Pravin Varaiya
PG
2003
IEEE
14 years 1 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
NIPS
2008
13 years 10 months ago
Tighter Bounds for Structured Estimation
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
Olivier Chapelle, Chuong B. Do, Quoc V. Le, Alexan...