Sciweavers

16430 search results - page 254 / 3286
» On Computable Tree Functions
Sort
View
JUCS
2008
122views more  JUCS 2008»
15 years 4 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev
CVPR
2012
IEEE
13 years 7 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
CVPR
2007
IEEE
16 years 6 months ago
Riemannian Analysis of Probability Density Functions with Applications in Vision
Anuj Srivastava, Ian Jermyn, Shantanu H. Joshi
FOCS
1994
IEEE
15 years 8 months ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...