3946 search results - page 350 / 790 » The computational complexity of choice sets |
218
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
172
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
173
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
In most previous NPR line rendering systems, geometric properties have been directly used to extract and stylize certain edges. However, this approach is bound to a tight stylizat...
196
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
168
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...