Sciweavers

413 search results - page 43 / 83
» On space constrained set selection problems
Sort
View
JMLR
2011
192views more  JMLR 2011»
14 years 11 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
RECOMB
2002
Springer
16 years 4 months ago
String barcoding: uncovering optimal virus signatures
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
Sam Rash, Dan Gusfield
ICML
2000
IEEE
16 years 5 months ago
Meta-Learning by Landmarking Various Learning Algorithms
Landmarking is a novel approach to describing tasks in meta-learning. Previous approaches to meta-learning mostly considered only statistics-inspired measures of the data as a sou...
Bernhard Pfahringer, Hilan Bensusan, Christophe G....
ICALP
2004
Springer
15 years 9 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
114
Voted
NIPS
2001
15 years 5 months ago
Switch Packet Arbitration via Queue-Learning
In packet switches, packets queue at switch inputs and contend for outputs. The contention arbitration policy directly affects switch performance. The best policy depends on the c...
Timothy X. Brown