Sciweavers

220 search results - page 41 / 44
» SMOS L1 algorithms
Sort
View
NIPS
2008
13 years 9 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
NIPS
2007
13 years 9 months ago
Feature Selection Methods for Improving Protein Structure Prediction with Rosetta
Rosetta is one of the leading algorithms for protein structure prediction today. It is a Monte Carlo energy minimization method requiring many random restarts to find structures ...
Ben Blum, Michael I. Jordan, David Kim, Rhiju Das,...
SPIESR
1997
97views Database» more  SPIESR 1997»
13 years 9 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
ICML
2010
IEEE
13 years 8 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
ICASSP
2010
IEEE
13 years 7 months ago
Sparse Bayesian step-filtering for high-throughput analysis of molecular machine dynamics
Nature has evolved many molecular machines such as kinesin, myosin, and the rotary flagellar motor powered by an ion current from the mitochondria. Direct observation of the step-...
Max A. Little, Nick S. Jones