144 search results - page 21 / 29 » Preprocessing for Optimization of Probabilistic-Logic Models... |
SSIAI
2000
IEEE
14 years 5 days ago
2000
IEEE
In this paper we propose a new probabilistic relaxation framework to perform robust multiple motion estimation and segmentation from a sequence of images. Our approach uses displa...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
HICSS
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
SAGA
2009
Springer
14 years 2 months ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
ECRTS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model...