Sciweavers

544 search results - page 40 / 109
» What cannot be computed locally!
Sort
View
LADC
2005
Springer
14 years 2 months ago
Timed Asynchronous Distributed Systems
We present a framework for building fail-safe hard real-time applications in timed asynchronous distributed systems subject to communication partitions and performance, omission, ...
Christof Fetzer
AIPS
2010
13 years 11 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
IJCV
2008
186views more  IJCV 2008»
13 years 8 months ago
Multi-Class Segmentation with Relative Location Prior
Multi-class image segmentation has made significant advances in recent years through the combination of local and global features. One important type of global feature is that of i...
Stephen Gould, Jim Rodgers, David Cohen, Gal Elida...
ICPR
2004
IEEE
14 years 9 months ago
Real-Time Face Detection Using Boosting in Hierarchical Feature Spaces
Boosting-basedmethods have recently led to the state-ofthe-art face detection systems. In these systems, weak classifiers to be boosted are based on simple, local, Haar-like featu...
Daniel Gatica-Perez, Dong Zhang, Stan Z. Li
CVPR
2010
IEEE
14 years 5 months ago
Exploiting Hierarchical Context on a Large Database of Object Categories
There has been a growing interest in exploiting contextual information in addition to local features to detect and localize multiple object categories in an image. Context models ...
Myung Jin Choi, Joseph Lim, Antonio Torralba, Alan...