468 search results - page 49 / 94 » One-Way Functions in Complexity Theory |
150
click to vote
RSCTC
2004
Springer
15 years 9 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...
124
click to vote
CIKM
2000
Springer
15 years 8 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
173
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
143
click to vote
JSCIC
2010
14 years 11 months ago
2010
This paper considers highly ill-posed surface recovery inverse problems, where the sought surface in 2D or 3D is piecewise constant with several possible level values. These level...
136
Voted
ACL
1994
15 years 5 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...