2661 search results - page 277 / 533 » Quantum Complexity Classes |
137
click to vote
ICDT
1999
ACM
15 years 8 months ago
1999
ACM
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
142
click to vote
VLDB
1999
ACM
15 years 8 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
156
click to vote
ALT
1997
Springer
15 years 8 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
140
click to vote
MICRO
1993
IEEE
15 years 8 months ago
1993
IEEE
The conventional classification of inter-instruction dependencies (data, anti and output dependencies) provides a basic scheme for the analysis of pipeline hazards in pipelined in...
144
click to vote
STACS
1992
Springer
15 years 8 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...