1632 search results - page 56 / 327 » On special numberings of hypergraphs |
154
click to vote
WADS
2007
Springer
16 years 12 days ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
164
click to vote
ARITH
2005
IEEE
15 years 12 months ago
2005
IEEE
Saturating counters are a newly defined class of generalized parallel counters that provide the exact number of inputs which are equal to 1 only if this number is below a given t...
164
click to vote
VTS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents a new fault-tolerance technique for cache memories. Current fault-tolerance techniques for caches are limited either by the number of faults that can be tolera...
149
click to vote
VISUALIZATION
1996
IEEE
15 years 10 months ago
1996
IEEE
In many cases the surfaces of geometric models consist of a large number of triangles. Several algorithms were developed to reduce the number of triangles required to approximate ...
132
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which p...