412 search results - page 27 / 83 » A New Proof of the F5 Algorithm |
CPP
2011
13 years 9 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
TIT
2010
14 years 4 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...