1486 search results - page 130 / 298 » Algorithms for two-box covering |
126
Voted
COMPGEOM
1999
ACM
15 years 8 months ago
1999
ACM
In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignm...
142
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves s...
121
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
121
Voted
ICGI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
119
click to vote
ICLP
1995
Springer
15 years 7 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...