Sciweavers

1082 search results - page 173 / 217
» Approximation Algorithms for Spreading Points
Sort
View
COMPGEOM
2000
ACM
14 years 1 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
SIBGRAPI
2005
IEEE
14 years 2 months ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
BMVC
2002
13 years 11 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 10 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
ATAL
2010
Springer
13 years 10 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen