Sciweavers

173 search results - page 5 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
CGF
2000
127views more  CGF 2000»
13 years 7 months ago
Interactive High-Quality Maximum Intensity Projection
Maximum Intensity Projection (MIP) is a volume rendering technique which is used to visualize high-intensity structures within volumetric data. At each pixel the highest data valu...
Lukas Mroz, Helwig Hauser, Eduard Gröller
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 9 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
IJISTA
2008
99views more  IJISTA 2008»
13 years 7 months ago
Increasing depth lateral resolution based on sensor fusion
Abstract: Technologies for measuring range data were intensively developed in recent years. The time-of-flight matrix range sensor is one of the most active range acquisition devic...
W. Hannemann, André Linarth, B. Liu, Gabrie...
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 1 days ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 2 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon