Sciweavers

2188 search results - page 58 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 6 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 2 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
ICIP
2000
IEEE
14 years 10 months ago
Acceleration of Filtering and Enhancement Operations Through Geometric Processing of Gray-Level Images
This paper describes an algorithm to implement image filtering and enhancement operations by processing adaptive triangular meshes that represent gray-level images. Experimental r...
Boris Xavier Vintimilla, Miguel Angel Garcí...
AMDO
2008
Springer
13 years 10 months ago
Mesh Vertex Pose and Position Interpolation Using Geometric Algebra
This paper presents a method of interpolating between two or more general displacements (rotation and translation). The resulting interpolated path is smooth and possesses a number...
Rich Wareham, Joan Lasenby
RC
2006
88views more  RC 2006»
13 years 8 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner