14699 search results - page 471 / 2940 » Complexity and Cognitive Computing |
218
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
211
click to vote
JCSS
2008
15 years 6 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
158
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
204
click to vote
PODS
2001
ACM
16 years 7 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
155
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...