16430 search results - page 539 / 3286 » On Computable Tree Functions |
268
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
197
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
191
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
169
click to vote
UAI
2001
15 years 8 months ago
2001
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
281
click to vote
ENTCS
2007
15 years 7 months ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...