136 search results - page 22 / 28 » Experimental Study of Minimum Cut Algorithms |
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
MLDM
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We propose an approach to build a classifier composing consistent (100% confident) rules. Recently, associative classifiers that utilize association rules have been widel...
JSAT
2010
14 years 4 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
122
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
104
Voted
WABI
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional genomics, pharmacogenetics and population ge...