Sciweavers

1096 search results - page 193 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
15 years 10 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
IDA
2002
Springer
14 years 9 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
CVPR
2005
IEEE
15 years 11 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik
SIGGRAPH
1993
ACM
15 years 1 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
RT
2000
Springer
15 years 1 months ago
Fast Global Illumination Including Specular Effects
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
Xavier Granier, George Drettakis, Bruce Walter