Sciweavers

1170 search results - page 57 / 234
» How Fast Is Too Fast
Sort
View
SMC
2010
IEEE
198views Control Systems» more  SMC 2010»
15 years 1 months ago
Fast tracking of natural textures using fractal snakes
Abstract — The natural environments that robotic applications often encounter can present difficult problems for imagebased task execution. Prior efforts have used both grayscale...
Christopher E. Smith
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
15 years 1 months ago
Fast Asynchronous Consensus with Optimal Resilience
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...
WEBI
2010
Springer
15 years 20 days ago
MQuery: Fast Graph Query via Semantic Indexing for Mobile Context
Mobile is becoming a ubiquitous platform for context-aware intelligent computing. One fundamental but usually ignored issue is how to efficiently manage (e.g., index and query) the...
Yuan Zhang, Ning Zhang, Jie Tang, Jinghai Rao, Wen...
ICCV
2009
IEEE
15 years 17 days ago
Non-iterative approach for fast and accurate vanishing point detection
We present an algorithm that quickly and accurately estimates vanishing points in images of man-made environments. Contrary to previously proposed solutions, ours is neither itera...
Jean-Philippe Tardif
ACCV
2010
Springer
14 years 10 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