Sciweavers

1957 search results - page 242 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
CGF
2010
135views more  CGF 2010»
14 years 6 months ago
Interactive Rendering of Non-Constant, Refractive Media Using the Ray Equations of Gradient-Index Optics
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
Chen Cao, Zhong Ren, Baining Guo, Kun Zhou
PAMI
2011
14 years 5 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
AAAI
2012
13 years 13 days ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...
ICRA
2010
IEEE
99views Robotics» more  ICRA 2010»
14 years 8 months ago
Retraction-based RRT planner for articulated models
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...
Jia Pan, Liangjun Zhang, Dinesh Manocha
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...