Sciweavers

6365 search results - page 430 / 1273
» Fast Local Computation Algorithms
Sort
View
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 7 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
ICCV
1995
IEEE
15 years 11 months ago
Bayesian Decision Theory, the Maximum Local Mass Estimate, and Color Constancy
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
William T. Freeman, David H. Brainard
HPCA
2008
IEEE
16 years 8 months ago
System level analysis of fast, per-core DVFS using on-chip switching regulators
Portable, embedded systems place ever-increasing demands on high-performance, low-power microprocessor design. Dynamic voltage and frequency scaling (DVFS) is a well-known techniq...
Wonyoung Kim, Meeta Sharma Gupta, Gu-Yeon Wei, Dav...
BMCBI
2010
86views more  BMCBI 2010»
15 years 7 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
BMCBI
2007
151views more  BMCBI 2007»
15 years 7 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...