2766 search results - page 87 / 554 » Algorithms for trigonometric polynomials |
124
Voted
STOC
1999
ACM
15 years 8 months ago
1999
ACM
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
137
Voted
ICGI
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
167
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
154
click to vote
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper presents a novel hybrid approach that combines state of the art fitting algorithms: algebraic-based and geometric-based. It consists of two steps; first, the 3L algorit...
57
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
For a given finite set of matrices with nonnegative integer entries we study the growth with t of max{ A1