Sciweavers

4007 search results - page 354 / 802
» Computation with imprecise probabilities
Sort
View
DCC
2009
IEEE
16 years 8 months ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
16 years 8 months ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan
CHI
2008
ACM
16 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...
HPCA
2007
IEEE
16 years 8 months ago
Implications of Device Timing Variability on Full Chip Timing
As process technologies continue to scale, the magnitude of within-die device parameter variations is expected to increase and may lead to significant timing variability. This pap...
Murali Annavaram, Ed Grochowski, Paul Reed
CHI
2004
ACM
16 years 8 months ago
Model for non-expert text entry speed on 12-button phone keypads
In this paper we present a new model for predicting text entry speed on a 12-button mobile phone keypad. The proposed model can predict the performance of novice users. Like other...
Andriy Pavlovych, Wolfgang Stürzlinger