Sciweavers

3630 search results - page 489 / 726
» Fast Marching Methods
Sort
View
148
Voted
CORR
2012
Springer
185views Education» more  CORR 2012»
13 years 12 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
TVCG
2012
203views Hardware» more  TVCG 2012»
13 years 6 months ago
Morse Set Classification and Hierarchical Refinement Using Conley Index
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
Guoning Chen, Qingqing Deng, Andrzej Szymczak, Rob...
ICDCS
2012
IEEE
13 years 6 months ago
NEAT: Road Network Aware Trajectory Clustering
—Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory clustering are mainly based on density and Euclidean di...
Binh Han, Ling Liu, Edward Omiecinski
CVPR
2009
IEEE
1524views Computer Vision» more  CVPR 2009»
16 years 11 months ago
3D Pose Estimation and Segmentation using Specular Cues
We present a system for fast model-based segmentation and 3D pose estimation of specular objects using appearance based specular features. We use observed (a) specular reflection...
Ju Yong Chang, Ramesh Raskar, Amit K. Agrawal
159
Voted
CGO
2010
IEEE
15 years 11 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...