130 search results - page 4 / 26 » Exact Algorithms for Exact Satisfiability and Number of Perf... |
STOC
1997
ACM
13 years 11 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
DMCS
2003
13 years 9 months ago
2003
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
COLING
2010
13 years 2 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...