Sciweavers

608 search results - page 55 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
IJCNN
2006
IEEE
14 years 2 months ago
Co-training using RBF Nets and Different Feature Splits
—In this paper we propose a new graph-based feature splitting algorithm maxInd, which creates a balanced split maximizing the independence between the two feature sets. We study ...
Felix Feger, Irena Koprinska
BMCBI
2008
146views more  BMCBI 2008»
13 years 9 months ago
A phase synchronization clustering algorithm for identifying interesting groups of genes from cell cycle expression data
Background: The previous studies of genome-wide expression patterns show that a certain percentage of genes are cell cycle regulated. The expression data has been analyzed in a nu...
Chang Sik Kim, Cheol Soo Bae, Hong Joon Tcha
NIPS
2007
13 years 10 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
ICASSP
2011
IEEE
13 years 17 days ago
Interpolation based on stationary and adaptive AR(1) modeling
In this paper, we describe a minimal mean square error (MMSE) optimal interpolation filter for discrete random signals. We explicitly derive the interpolation filter for a firs...
Eija Johansson, Marie Strom, Mats Viberg, Lennart ...
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
14 years 3 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...