Sciweavers

3837 search results - page 561 / 768
» Learning Approximate Consistencies
Sort
View
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 7 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
HPCA
2006
IEEE
16 years 6 months ago
Construction and use of linear regression models for processor performance analysis
Processor architects have a challenging task of evaluating a large design space consisting of several interacting parameters and optimizations. In order to assist architects in ma...
P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthav...
RECOMB
2003
Springer
16 years 6 months ago
Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
Gene W. Yeo, Christopher B. Burge
DCC
2008
IEEE
16 years 6 months ago
Rate-Distortion Functions for Nonstationary Gaussian Autoregressive Processes
Source coding theorems and Shannon rate-distortion functions were studied for the discrete-time Wiener process by Berger and generalized to nonstationary Gaussian autoregressive p...
Robert M. Gray, Takeshi Hashimoto
ICCD
2002
IEEE
88views Hardware» more  ICCD 2002»
16 years 3 months ago
Improving Processor Performance by Simplifying and Bypassing Trivial Computations
During the course of a program’s execution, a processor performs many trivial computations; that is, computations that can be simplified or where the result is zero, one, or equ...
Joshua J. Yi, David J. Lilja