7106 search results - page 861 / 1422 » Restricted Complexity, General Complexity |
242
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
268
click to vote
WOSP
1998
ACM
15 years 11 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
188
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
199
click to vote
LPNMR
1997
Springer
15 years 11 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
208
click to vote
SIGMOD
1996
ACM
15 years 11 months ago
1996
ACM
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...