Sciweavers

999 search results - page 95 / 200
» Finding shapes in a set of points
Sort
View
COMGEO
2004
ACM
14 years 9 months ago
Minimal enclosing parallelepiped in 3D
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
Frédéric Vivien, Nicolas Wicker
COLT
2010
Springer
14 years 7 months ago
Principal Component Analysis with Contaminated Data: The High Dimensional Case
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
Huan Xu, Constantine Caramanis, Shie Mannor
WSC
1997
14 years 11 months ago
Simulation Optimization Using Simultaneous Replications and Event Time Dilation
A new approach to simulation response optimization is presented that takes advantage of the ability to run simultaneous replications of different experimental factor settings in a...
Lee Schruben
ISVD
2007
IEEE
15 years 4 months ago
Voronoi Diagram with Respect to Criteria on Vision Information
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi T...
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 2 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim