1458 search results - page 62 / 292 » The sequentially realizable functionals |
138
Voted
EUROCRYPT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
124
Voted
EWC
2000
15 years 3 months ago
2000
We explore the meanings of the terms as "structure," "behavior," and, especially, "function" in engineering practice. Computers provide great help in...
123
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...
114
Voted
ALT
2001
Springer
16 years 13 days ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
120
click to vote
MCS
2009
Springer
15 years 10 months ago
2009
Springer
The availability of an ever increasing amount of data sources due to recent advances in high throughput biotechnologies opens unprecedented opportunities for genome-wide gene funct...