Sciweavers

2312 search results - page 362 / 463
» The complexity of estimating min-entropy
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 6 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICSE
2008
IEEE-ACM
16 years 6 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
16 years 3 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
CVPR
2010
IEEE
16 years 2 months ago
Denoising vs. Deblurring: HDR Imaging Techniques Using Moving Cameras
New cameras such as the Canon EOS 7D and Pointgrey Grasshopper have 14-bit sensors. We present a theoretical analysis and a practical approach that exploit these new cameras with ...
Li Zhang, Alok Deshpande, Xin Chen
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
16 years 1 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak