Sciweavers

1027 search results - page 45 / 206
» Ordered Vertex Partitioning
Sort
View
ICCV
2005
IEEE
14 years 11 months ago
Dynamic Measurement Clustering to Aid Real Time Tracking
Many parameter estimation problems admit divide and conquer or partitioning techniques in order to reduce a highdimensional task into several reduced-dimension problems. These tec...
Christopher Kemp, Tom Drummond
MCS
2005
Springer
14 years 3 months ago
Ensembles of Classifiers from Spatially Disjoint Data
We describe an ensemble learning approach that accurately learns from data that has been partitioned according to the arbitrary spatial requirements of a large-scale simulation whe...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
SIGGRAPH
2000
ACM
14 years 1 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
CP
2005
Springer
14 years 3 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
LION
2009
Springer
152views Optimization» more  LION 2009»
14 years 4 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
Cédric Chevalier, Ilya Safro