1092 search results - page 24 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
EVOW
2008
Springer
15 years 1 months ago
2008
Springer
Image mining and interpretation is a quite complex process. In this article, we propose to model expert knowledge on objects present in an image through an ontology. This ontology ...
JACM
2000
14 years 11 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
STOC
2003
ACM
16 years 1 days ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
212
click to vote
POPL
2003
ACM
16 years 1 days ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
ECCC
2010
14 years 11 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...