Sciweavers

301 search results - page 42 / 61
» On the Optimality of Probability Estimation by Random Decisi...
Sort
View
JMLR
2012
11 years 10 months ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
NECO
2011
13 years 2 months ago
Least Squares Estimation Without Priors or Supervision
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...
Martin Raphan, Eero P. Simoncelli
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 9 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 2 days ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
MLDM
2005
Springer
14 years 1 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé