Sciweavers

3630 search results - page 246 / 726
» Fast Marching Methods
Sort
View
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 7 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Fitted BVH for Fast Raytracing of Metaballs
Raytracing metaballs is a problem that has numerous applications in the rendering of dynamic soft objects such as fluids. However, current techniques are either limited in the vi...
Olivier Gourmel, Anthony Pajot, Mathias Paulin, Lo...
ICCAD
2008
IEEE
110views Hardware» more  ICCAD 2008»
16 years 3 months ago
NTHU-Route 2.0: a fast and stable global router
—We present in this paper a fast and stable global router called NTHU-Route 2.0 that improves the solution quality and runtime of a state-of-the-art router, NTHU-Route, by the fo...
Yen-Jung Chang, Yu-Ting Lee, Ting-Chi Wang
CVPR
2010
IEEE
16 years 2 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
16 years 1 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu