Sciweavers

662 search results - page 36 / 133
» Cheap and Fast - But is it Good
Sort
View
IM
2008
13 years 7 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
CLEIEJ
2010
13 years 5 months ago
Hybrid Rugosity Mesostructures (HRMs) for fast and accurate rendering of fine haptic detail
The haptic rendering of surface mesostructure (fine relief features) in dense triangle meshes requires special structures, equipment, and high sampling rates for detailed perceptio...
Víctor Theoktisto, Marta Fairén Gonz...
ICIAR
2010
Springer
13 years 5 months ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
JCNS
2010
90views more  JCNS 2010»
13 years 2 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski