Sciweavers

3256 search results - page 41 / 652
» Learning Linear Transformations
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
CDC
2009
IEEE
112views Control Systems» more  CDC 2009»
13 years 11 months ago
A Floquet-like factorization for linear periodic systems
In this note, the novel representation is proposed for a linear periodic continuous-time system with T-periodic real-valued coefficients. We prove that a T-periodic real-valued fac...
Ichiro Jikuya, Ichijo Hodaka
ICALP
2010
Springer
13 years 9 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ICML
2000
IEEE
13 years 12 months ago
Mutual Information in Learning Feature Transformations
We present feature transformations useful for exploratory data analysis or for pattern recognition. Transformations are learned from example data sets by maximizing the mutual inf...
Kari Torkkola, William M. Campbell
ICML
2007
IEEE
14 years 8 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern