3690 search results - page 400 / 738 » Computation with classical sequents |
195
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
177
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
219
click to vote
PPOPP
2006
ACM
16 years 23 days ago
2006
ACM
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
170
click to vote
CEC
2005
IEEE
16 years 13 days ago
2005
IEEE
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
192
click to vote
SIGIR
2005
ACM
16 years 11 days ago
2005
ACM
We introduce a new model for semantic annotation and retrieval from image databases. The new model is based on a probabilistic formulation that poses annotation and retrieval as c...