2485 search results - page 87 / 497 » Time Bounded Frequency Computations |
130
Voted
COCO
2001
Springer
15 years 9 months ago
2001
Springer
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
154
click to vote
FOCS
1990
IEEE
15 years 8 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
132
click to vote
BIBE
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
122
Voted
CCS
2010
ACM
15 years 4 months ago
2010
ACM
We investigate techniques for general black-box mitigation of timing channels. The source of events is wrapped by a timing mitigator that delays output events so that they contain...
138
click to vote
AI
2007
Springer
15 years 4 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...