Sciweavers

2740 search results - page 30 / 548
» Approximating Component Selection
Sort
View
RECOMB
1997
Springer
15 years 1 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
ICA
2004
Springer
15 years 3 months ago
A Model for Analyzing Dependencies Between Two ICA Features in Natural Images
Abstract. In this paper we examine how the activation of one independent component analysis (ICA) feature changes first and second order statistics of other independent components...
Mika Inki
INFOCOM
2009
IEEE
15 years 4 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
IJCNN
2007
IEEE
15 years 4 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...
CORR
2010
Springer
100views Education» more  CORR 2010»
14 years 9 months ago
Convex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...