Sciweavers

379 search results - page 47 / 76
» Strong reducibility of partial numberings
Sort
View
QUESTA
2007
98views more  QUESTA 2007»
13 years 9 months ago
The acquisition queue
We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server not only serves customers, but also performs acquisit...
Dee Denteneer, J. S. H. van Leeuwaarden, Ivo J. B....
ATS
2009
IEEE
92views Hardware» more  ATS 2009»
13 years 7 months ago
M-IVC: Using Multiple Input Vectors to Minimize Aging-Induced Delay
Negative bias temperature instability (NBTI) has been a significant reliability concern in current digital circuit design due to its effect of increasing the path delay with time a...
Song Jin, Yinhe Han, Lei Zhang 0008, Huawei Li, Xi...
CVPR
2011
IEEE
13 years 6 months ago
Learning Effective Human Pose Estimation from Inaccurate Annotation
The task of 2-D articulated human pose estimation in natural images is extremely challenging due to the high level of variation in human appearance. These variations arise from di...
Sam Johnson, Mark Everingham
DISOPT
2011
240views Education» more  DISOPT 2011»
13 years 4 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 4 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef