14774 search results - page 2788 / 2955 » Computational complexity and evolutionary computation |
124
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
182
Voted
PAMI
2002
15 years 4 months ago
2002
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
164
click to vote
SAC
2002
ACM
15 years 4 months ago
2002
ACM
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
147
Voted
TCS
1998
15 years 4 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
155
click to vote
TKDE
1998
15 years 4 months ago
1998
—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency an...