Sciweavers

336 search results - page 38 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
CHI
2008
ACM
14 years 8 months ago
Predicting postcompletion errors using eye movements
A postcompletion error is a distinct type of procedural error where one fails to complete the final step of a task. While redesigning interfaces and providing explicit cues have b...
Raj M. Ratwani, J. Malcolm McCurry, J. Gregory Tra...
DAC
2007
ACM
14 years 8 months ago
TROY: Track Router with Yield-driven Wire Planning
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
DSN
2005
IEEE
14 years 1 months ago
Coverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems
A Cyclic Redundancy Code (CRC), when used properly, can be an effective and relatively inexpensive method to detect data corruption across communication channels. However, some sy...
Michael Paulitsch, Jennifer Morris, Brendan Hall, ...
CVPR
2004
IEEE
14 years 9 months ago
Gibbs Likelihoods for Bayesian Tracking
Bayesian methods for visual tracking model the likelihood of image measurements conditioned on a tracking hypothesis. Image measurements may, for example, correspond to various fi...
Stefan Roth, Leonid Sigal, Michael J. Black
IMC
2006
ACM
14 years 1 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...