2766 search results - page 220 / 554 » Algorithms for trigonometric polynomials |
165
click to vote
TACAS
2012
Springer
14 years 7 days ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
135
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
158
click to vote
ESA
2000
Springer
15 years 8 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
118
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...
120
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...