Sciweavers

182 search results - page 13 / 37
» A general probabilistic framework for worst case timing anal...
Sort
View
JPDC
2006
85views more  JPDC 2006»
13 years 7 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
ICWS
2009
IEEE
14 years 4 months ago
Flexible Probabilistic QoS Management of Transaction Based Web Services Orchestrations
—In this paper we extend our previous work on soft probabilistic contracts for QoS management, from the particular case of “response time”, to general QoS parameters. Our stu...
Sidney Rosario, Albert Benveniste, Claude Jard
STACS
2004
Springer
14 years 28 days ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
IVC
2010
95views more  IVC 2010»
13 years 6 months ago
Monocular head pose estimation using generalized adaptive view-based appearance model
Accurately estimating the person’s head position and orientation is an important task for a wide range of applications such as driver awareness, meeting analysis and human-robot...
Louis-Philippe Morency, Jacob Whitehill, Javier R....