Sciweavers

237 search results - page 30 / 48
» Approximation Algorithms for Minimum Tree Partition
Sort
View
GIS
2004
ACM
14 years 9 months ago
Adaptive hierarchical RBF interpolation for creating smooth digital elevation models
This paper presents a fast algorithm for smooth digital elevation model interpolation and approximation from scattered elevation data. The global surface is reconstructed by subdi...
Joachim Pouderoux, Jean-Christophe Gonzato, Ireneu...
WWW
2011
ACM
13 years 3 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
CATS
2006
13 years 10 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
PDPTA
2003
13 years 10 months ago
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
Thomas E. Portegys, Kevin M. Greenan
JCSS
2011
95views more  JCSS 2011»
13 years 3 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger