Sciweavers

663 search results - page 65 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
14 years 1 months ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
14 years 2 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...
RTSS
2005
IEEE
14 years 1 months ago
A Deferrable Scheduling Algorithm for Real-Time Transactions Maintaining Data Freshness
Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past ...
Ming Xiong, Song Han, Kam-yiu Lam
AMC
2005
138views more  AMC 2005»
13 years 7 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
EURODAC
1995
IEEE
130views VHDL» more  EURODAC 1995»
13 years 11 months ago
Semi-dynamic scheduling of synchronization-mechanisms
This paper presents a novel approach to scheduling of hardware supported synchronization operations. The optimization goal is to minimize the interation time of processes and thus...
Wolfgang Ecker