Sciweavers

247 search results - page 41 / 50
» Superset Learning Based on Generalized Loss Minimization
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Reliable Wireless Broadcasting with Near-Zero Feedback
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
Weiyao Xiao, Sachin Agarwal, David Starobinski, Ar...
SMA
2003
ACM
173views Solid Modeling» more  SMA 2003»
15 years 3 months ago
Automating the CAD/CAE dimensional reduction process
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
Krishnan Suresh
ICML
2007
IEEE
15 years 10 months ago
Simpler core vector machines with enclosing balls
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...
András Kocsor, Ivor W. Tsang, James T. Kwok
ICML
2008
IEEE
15 years 10 months ago
Sequence kernels for predicting protein essentiality
The problem of identifying the minimal gene set required to sustain life is of crucial importance in understanding cellular mechanisms and designing therapeutic drugs. This work d...
Cyril Allauzen, Mehryar Mohri, Ameet Talwalkar
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
15 years 10 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney