Sciweavers

690 search results - page 4 / 138
» Dense Admissible Sets
Sort
View
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
14 years 13 days ago
Constant-time admission control for Deadline Monotonic tasks
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...
Alejandro Masrur, Samarjit Chakraborty, Georg F&au...
CVPR
2001
IEEE
14 years 9 months ago
Semi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
IJCV
2002
157views more  IJCV 2002»
13 years 7 months ago
Dense Features for Semi-Dense Stereo Correspondence
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
LFCS
2009
Springer
14 years 1 months ago
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissib...
Rosalie Iemhoff, George Metcalfe
RTCSA
2003
IEEE
14 years 18 days ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong