Sciweavers

2229 search results - page 45 / 446
» Comparative analysis of biclustering algorithms
Sort
View
DAS
2006
Springer
15 years 3 months ago
Performance Comparison of Six Algorithms for Page Segmentation
Abstract. This paper presents a quantitative comparison of six algorithms for page segmentation: X-Y cut, smearing, whitespace analysis, constrained text-line finding, Docstrum, an...
Faisal Shafait, Daniel Keysers, Thomas M. Breuel
NIPS
2004
15 years 1 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
JMLR
2012
13 years 2 months ago
A Stick-Breaking Likelihood for Categorical Data Analysis with Latent Gaussian Models
The development of accurate models and efficient algorithms for the analysis of multivariate categorical data are important and longstanding problems in machine learning and compu...
Mohammad Emtiyaz Khan, Shakir Mohamed, Benjamin M....
CORR
2008
Springer
128views Education» more  CORR 2008»
14 years 12 months ago
A Quantifier Elimination Algorithm for Linear Real Arithmetic
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
David Monniaux
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 3 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale