Sciweavers

847 search results - page 79 / 170
» Approximation algorithms for projective clustering
Sort
View
BMCBI
2008
117views more  BMCBI 2008»
15 years 24 days ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...
107
Voted
AAAI
2007
15 years 3 months ago
Scaling Up: Solving POMDPs through Value Based Clustering
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen ...
103
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
122
Voted
CPAIOR
2008
Springer
15 years 2 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
93
Voted
ICCV
2009
IEEE
16 years 5 months ago
An Algorithm for Minimizing the Piecewise Smooth Mumford-Shah Functional
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algori...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...