Sciweavers

359 search results - page 14 / 72
» On Complete Primitives for Fairness
Sort
View
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 9 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
AMFG
2005
IEEE
256views Biometrics» more  AMFG 2005»
14 years 1 months ago
Robust Facial Landmark Detection for Intelligent Vehicle System
Abstract. This paper presents an integrated approach for robustly locating facial landmark for drivers. In the first step a cascade of probability learners is used to detect the f...
Junwen Wu, Mohan M. Trivedi
CAV
2003
Springer
166views Hardware» more  CAV 2003»
14 years 18 days ago
Bridging the Gap between Fair Simulation and Trace Inclusion
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Yonit Kesten, Nir Piterman, Amir Pnueli
ASIACRYPT
2008
Springer
13 years 9 months ago
Ambiguous Optimistic Fair Exchange
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Su...
CF
2009
ACM
14 years 1 months ago
A light-weight fairness mechanism for chip multiprocessor memory systems
Chip Multiprocessor (CMP) memory systems suffer from the effects of destructive thread interference. This interference reduces performance predictability because it depends heavil...
Magnus Jahre, Lasse Natvig