843 search results - page 76 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
117
click to vote
ALENEX
2008
15 years 3 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
118
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 2 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
134
click to vote
CGF
2010
14 years 11 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
107
click to vote
EDBT
2006
ACM
16 years 1 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
128
Voted
JCB
2007
15 years 1 months ago
2007
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...