Sciweavers

6365 search results - page 271 / 1273
» Fast Local Computation Algorithms
Sort
View
ICPR
2006
IEEE
16 years 7 months ago
Fast Dynamic Mosaicing and Person Following
A system for video surveillance purposes in wide areas based on active cameras, also capable to follow a person in the scene by keeping him framed, is presented. The proposed appr...
Andrea Prati, Fabrizio Seghedoni, Rita Cucchiara
ICML
2006
IEEE
16 years 7 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
DAC
2009
ACM
15 years 10 months ago
Fast vectorless power grid verification using an approximate inverse technique
Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an ea...
Nahi H. Abdul Ghani, Farid N. Najm
PAMI
2010
249views more  PAMI 2010»
15 years 5 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
BMCBI
2007
107views more  BMCBI 2007»
15 years 6 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg