Sciweavers

1326 search results - page 47 / 266
» Approximate Tree Kernels
Sort
View
STOC
2005
ACM
89views Algorithms» more  STOC 2005»
14 years 9 months ago
Universal approximations for TSP, Steiner tree, and set cover
Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...
FOCS
1996
IEEE
14 years 25 days ago
A 3-Approximation for the Minimum Tree Spanning k Vertices
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
Naveen Garg
SI3D
2006
ACM
14 years 2 months ago
Approximate ambient occlusion for trees
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
Kyle Hegeman, Simon Premoze, Michael Ashikhmin, Ge...
JEA
2008
112views more  JEA 2008»
13 years 8 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 8 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon