2766 search results - page 292 / 554 » Algorithms for trigonometric polynomials |
139
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
122
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
166
click to vote
ICGI
2010
Springer
15 years 6 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
134
click to vote
ALGORITHMICA
2010
15 years 5 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
135
Voted
DM
2010
15 years 5 months ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...