2435 search results - page 126 / 487 » Question Answering in Webclopedia |
152
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...
148
click to vote
BRAIN
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. In this paper, we want to farther advance the parallelism between models of the brain and computing machines. We want to apply the same idea underlying neuroimaging techn...
130
click to vote
ORL
2007
15 years 5 months ago
2007
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...
204
click to vote
PROPERTYTESTING
2010
15 years 4 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
187
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...