Sciweavers

943 search results - page 127 / 189
» How should data structures and algorithms be taught
Sort
View
CGF
2004
151views more  CGF 2004»
13 years 9 months ago
Deferred Splatting
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...
SDM
2004
SIAM
141views Data Mining» more  SDM 2004»
13 years 10 months ago
Visually Mining through Cluster Hierarchies
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aid...
Stefan Brecheisen, Hans-Peter Kriegel, Peer Kr&oum...
PAMI
2008
391views more  PAMI 2008»
13 years 9 months ago
Riemannian Manifold Learning
Recently, manifold learning has been widely exploited in pattern recognition, data analysis, and machine learning. This paper presents a novel framework, called Riemannian manifold...
Tong Lin, Hongbin Zha
GRAPHICSINTERFACE
2003
13 years 10 months ago
CInDeR: Collision and Interference Detection in Real-time using graphics hardware
Collision detection is a vital task in almost all forms of computer animation and physical simulation. It is also one of the most computationally expensive, and therefore a freque...
Dave Knott, Dinesh K. Pai
IPL
2010
71views more  IPL 2010»
13 years 7 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson