16430 search results - page 347 / 3286 » On Computable Tree Functions |
172
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
168
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
158
click to vote
CGF
1998
15 years 6 months ago
1998
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
231
click to vote
CGF
2010
15 years 5 months ago
2010
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
153
click to vote
LCPC
2005
Springer
16 years 6 days ago
2005
Springer
Eden is a parallel extension of the functional language Haskell. Eden inherits from Haskell its laziness, which allows it to avoid unnecessary computations. However, in order to en...