6142 search results - page 277 / 1229 » The Complexity of Partition Functions |
160
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
189
click to vote
JMLR
2012
13 years 8 months ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
256
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
147
click to vote
ALT
2001
Springer
16 years 3 months 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...
127
click to vote
ARITH
2007
IEEE
16 years 16 days ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...