Sciweavers

500 search results - page 61 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
CAD
2011
Springer
13 years 3 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
NIPS
2007
13 years 9 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
CDC
2009
IEEE
164views Control Systems» more  CDC 2009»
13 years 5 months ago
Real-time MPC - Stability through robust MPC design
Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-...
Melanie Nicole Zeilinger, Colin Neil Jones, Davide...
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
14 years 1 months ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu
CVPR
2011
IEEE
13 years 4 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang