Sciweavers

85 search results - page 16 / 17
» A DC Programming Approach for Sparse Eigenvalue Problem
Sort
View
94
Voted
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
14 years 10 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg
BMCBI
2005
158views more  BMCBI 2005»
14 years 9 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 3 months ago
Finding interesting things
Model- and simulation-designers are often interested not in the optimum output of their system, but in understanding how the output is sensitive to different parameters. This can...
Sean Luke, Deepankar Sharma, Gabriel Catalin Balan
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
15 years 10 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
88
Voted
CADE
2007
Springer
15 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard