2766 search results - page 223 / 554 » Algorithms for trigonometric polynomials |
147
click to vote
ADG
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
166
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
166
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
133
click to vote
FCT
2003
Springer
15 years 10 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
169
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...