1566 search results - page 135 / 314 » On a Cone Covering Problem |
112
click to vote
ITC
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper describes a system for performing high precision IDDQ measurement of CMOS ICs having a large peak current during operation. Although the measurement rate is at a low sp...
145
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...
127
click to vote
ICGI
2000
Springer
15 years 8 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...
130
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
121
click to vote
JSYML
2008
15 years 4 months ago
2008
Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the inter...