1688 search results - page 208 / 338 » The Complexity of Rationalizing Matchings |
103
click to vote
COMPGEOM
1998
ACM
15 years 3 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
KDD
1997
ACM
15 years 3 months ago
1997
ACM
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
111
click to vote
PODS
1993
ACM
15 years 3 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
As process technology continues to scale into the nanoscale regime, interconnect plays an ever increasing role in determining VLSI system performance. As the complexity of these sy...