2060 search results - page 172 / 412 » Some Applications of Coding Theory in Computational Complexi... |
114
click to vote
ERSHOV
2009
Springer
15 years 1 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of searchbased performance optimizatio...
RSCTC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
AAAI
1994
14 years 11 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...