Sets P. KUMAR and E. A. YILDIRIM Communicated by Y. Zhang We thank the...  Home/Search
Context
Related
| compgeom.com/~piyush/papers/mve.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: compgeom.com/~piyush/publicat (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the problem of computing a (1 + #)-approximation to the minimum volume enclosing ellipsoid of a given point set , p . Based on a simple, initial volume approximation method, we propose a modification of Khachiyan's first-order algorithm. Our analysis leads to a slightly improved complexity bound of O(nd (0, 1). As a byproduct, our algorithm returns a core set with the property that the minimum volume enclosing ellipsoid of provides a good approximation to that ... (Update)
Active bibliography (related documents): More All
1.2: On Numerical Solution of the Maximum Volume Ellipsoid Problem - Liyan (2001) (Correct)
1.0: Computation of Minimum Volume Covering Ellipsoids - Sun, Freund (2003) (Correct)
0.7: An Interior-Point Algorithm for the Maximum-Volume Ellipsoid Problem - Zhang (1999) (Correct)
Similar documents based on text: More All
0.1: Warm-Start Strategies In Interior-Point Methods For Linear.. - Yildirim, Wright (2000) (Correct)
0.1: On Core-sets and Slabs - Har-Peled (2003) (Correct)
0.1: Projective Clustering in High Dimensions Using Core-Sets - Har-Peled, Varadarajan (2003) (Correct)
BibTeX entry: (Update)
@misc{ and-minimumvolume,
author = "Sets Kumar And",
title = "Minimum-Volume Enclosing Ellipsoids and Core",
url = "citeseer.ist.psu.edu/731678.html" }
Citations (may not include all citations):307 Interior-Point Polynomial Methods in Convex Programming (context) - Yu, Nemirovskii - 1994
134 Geometric Algorithms and Combinatorial Optimization (context) - otschel, Lov et al. - 1988
81 A Subexponential Bound for Linear Programming - sek, Sharir et al. - 1992
69 Determinant Maximization with Linear Matrix Inequality Const.. - Vandenberghe, Boyd et al. - 1998
58 Robust Analysis of Feature Spaces: Color Image Segmentation - Comaniciu, Meer - 1997
57 Extremum Problems with Inequalities as Subsidiary Conditions (context) - John - 1985
53 Robust Clustering with Applications in Computer Vision (context) - Jolion, Meer et al. - 1991
50 On Linear Time Deterministic Algorithms for Optimization Pro.. - Chazelle, Matou - 1993
23 Approximate Clustering via Core Sets - adoiu, Har-Peled et al. - 2002
20 the Complexity of Approximating the Maximal Inscribed Ellips.. (context) - Khachiyan, Todd - 1993
17 Lectures on Discrete Geometry (context) - sek - 2001
16 Game Engine Design: A Practical Approach to Real-Time Comput.. (context) - Eberly - 2001
15 The Method of Inscribed Ellipsoids (context) - Tarasov, Khachiyan et al. - 1988
12 A Randomization Scheme for Speeding Up Algorithms for Linear.. (context) - Adler, Shamir - 1993
10 Bounding Ellipsoid for Ray-Fractal Intersection (context) - Bouville - 1985
8 Rounding of Polytopes in the Real Number Model of Computatio.. (context) - Khachiyan - 1996
8 Optimal Design: Some Geometrical Aspects of DOptimality (context) - Titterington - 1975
8 Minimum Covering Ellipses (context) - Silverman, Titterington - 1980
8 Robust Space Transformations for Distance-Based Operations - Knorr, Ng et al. - 2001
7 New Results and New Trends in Computer Science (context) - Welzl, Smallest - 1991
6 An Interior-Point Algorithm for the Maximum-Volume Ellipsoid.. - Zhang - 1998
5 Estimation of Correlation Coe#cients by Ellipsoidal Trimming (context) - Titterington - 1978
4 Pattern Separation via Ellipsoids and Conic Programming - Glineur - 1998
4 ciently Approximating the MinimumVolume Bounding Box of a Po.. (context) - Barequet, Har-Peled - 2001
4 Smaller Core Sets for Balls (context) - adoiu, Clarkson - 2003
4 On Numerical Solution of the Maximum Volume Ellipsoid Proble.. - Zhang, Gao - 2003
3 Approximating the Volume of Convex Bodies (context) - Betke, Henk - 1993
3 A Geometric Approach to Optimal Design Theory (context) - Silvey, Titterington - 1973
3 Primal-Dual Path-Following Algorithms for Determinant Maximi.. - Toh - 1999
2 Improved Complexity for Maximum Volume Inscribed Ellipsoids - Anstreicher - 2003
1 Exact Primitives for Smallest Enclosing Ellipses (context) - artner, Sch - 1997
1 Computation of Minimum Volume Covering Ellipsoids - Sun, Freund - 2004
1 Quantile Approximation for Robust Statistical Estimation and.. - Mount, Netanyahu et al. - 2000
1 Faster Core Set Constructions and Data-Stream Algorithms in .. - Chan - 2004
1 Practical Methods for Shape Fitting and Kinetic Data Structu.. (context) - Aggarwal, Poreddy et al. - 2004
1 Approximate Minimum Enclosing Balls in High Dimensions Using.. - Kumar, Mitchell et al. - 2003
1 On Self--Concordant Convex--Concave Functions (context) - Nemirovskii - 1999
Documents on the same site (http://www.compgeom.com/~piyush/publicat.html): More
I/O-Efficient Construction of Voronoi Diagrams - Kumar, Ramos (2002) (Correct)
Finding Large Sticks and Potatoes in Polygons - Hall-Holt, Katz, Kumar.. (2006) (Correct)
CSE 648: Advanced algorithms - Topic Vc-Dimension Nets (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC