Sciweavers

3630 search results - page 233 / 726
» Fast Marching Methods
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 7 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
IROS
2009
IEEE
178views Robotics» more  IROS 2009»
16 years 1 months ago
Fast detection of arbitrary planar surfaces from unreliable 3D data
Abstract— Man-made real-world environments are dominated by planar surfaces many of which constitute behaviorrelevant entities. Thus, the ability to perceive planar surfaces is v...
Martin Heracles, Bram Bolder, Christian Goerick
CGO
2008
IEEE
16 years 29 days ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
ICASSP
2007
IEEE
16 years 25 days ago
Fast Line-Based Imaging of Small Sample Features
This project aims to reduce the time required to attain more detailed scans of small interesting regions present in a quick first-pass sample image. In particular, we concentrate...
Mark A. Iwen, Gurjit S. Mandair, Michael D. Morris...
ICCV
2007
IEEE
16 years 25 days ago
Fast Automatic Heart Chamber Segmentation from 3D CT Data Using Marginal Space Learning and Steerable Features
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
Yefeng Zheng, Adrian Barbu, Bogdan Georgescu, Mich...