Sciweavers

3894 search results - page 498 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
PKDD
2010
Springer
162views Data Mining» more  PKDD 2010»
15 years 2 months ago
Expectation Propagation for Bayesian Multi-task Feature Selection
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
Daniel Hernández-Lobato, José Miguel...
ACL
2009
15 years 2 months ago
Stochastic Gradient Descent Training for L1-regularized Log-linear Models with Cumulative Penalty
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...
Yoshimasa Tsuruoka, Jun-ichi Tsujii, Sophia Anania...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 5 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
DCC
2005
IEEE
16 years 4 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
16 years 1 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio