Sciweavers

6365 search results - page 300 / 1273
» Fast Local Computation Algorithms
Sort
View
ISBI
2008
IEEE
16 years 7 months ago
Fast nonlocal filtering applied to electron cryomicroscopy
We present an efficient algorithm for nonlocal image filtering with applications in electron cryomicroscopy. Our denoising algorithm is a rewriting of the recently proposed nonloc...
Alexandre Cunha, Grant J. Jensen, Jérô...
ROBOCUP
2007
Springer
99views Robotics» more  ROBOCUP 2007»
16 years 24 days ago
Instance-Based Action Models for Fast Action Planning
Abstract. Two main challenges of robot action planning in real domains are uncertain action effects and dynamic environments. In this paper, an instance-based action model is lear...
Mazda Ahmadi, Peter Stone
AFRIGRAPH
2006
ACM
16 years 20 days ago
Cost prediction for global illumination using a fast rasterised scene preview
The media industry is demanding increasing fidelity for their rendered images. Despite the advent of modern GPUs, the computational requirements of physically based global illumi...
Richard Gillibrand, Peter Longhurst, Kurt Debattis...
ICML
2010
IEEE
15 years 7 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CGF
2008
128views more  CGF 2008»
15 years 6 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...