16430 search results - page 91 / 3286 » On Computable Tree Functions |
156
click to vote
ITA
2007
15 years 3 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
107
click to vote
RECOMB
2008
Springer
16 years 3 months ago
2008
Springer
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
110
Voted
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
103
click to vote
CVDB
2004
ACM
15 years 8 months ago
2004
ACM
In this paper we describe PIBE, a new Personalizable Image Browsing Engine that allows an effective visual exploration of large image collections combining computer vision and da...
120
Voted
CIE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...