Sciweavers

1813 search results - page 328 / 363
» Calculi of Approximation Spaces
Sort
View
149
Voted
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
15 years 3 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
144
Voted
JACM
2007
160views more  JACM 2007»
15 years 3 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
135
Voted
CAD
2005
Springer
15 years 3 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
165
Voted
CGF
2007
168views more  CGF 2007»
15 years 3 months ago
Global Illumination using Photon Ray Splatting
We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...
Robert Herzog, Vlastimil Havran, Shin-ichi Kinuwak...
JAIR
2002
95views more  JAIR 2002»
15 years 3 months ago
SMOTE: Synthetic Minority Over-sampling Technique
An approach to the construction of classifiers from imbalanced datasets is described. A dataset is imbalanced if the classification categories are not approximately equally repres...
Nitesh V. Chawla, Kevin W. Bowyer, Lawrence O. Hal...