16430 search results - page 103 / 3286 » On Computable Tree Functions |
120
Voted
ECCV
2000
Springer
16 years 5 months ago
2000
Springer
We describe a method for computing the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane, that is, a m...
140
Voted
ADHOCNOW
2005
Springer
15 years 9 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
130
click to vote
NCA
2007
IEEE
15 years 2 months ago
2007
IEEE
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
123
Voted
CCA
2009
Springer
15 years 10 months ago
2009
Springer
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
106
Voted
DCG
2006
15 years 3 months ago
2006
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we prese...