Sciweavers

2183 search results - page 77 / 437
» Multi-pass geometric algorithms
Sort
View
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
13 years 11 months ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
ICC
2009
IEEE
105views Communications» more  ICC 2009»
13 years 7 months ago
Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming
This paper proposes Reflected Simplex codebooks for limited feedback beamforming in multiple-input multipleoutput (MIMO) wireless systems. The codebooks are a geometric constructio...
Daniel J. Ryan, Iain B. Collings, Jean-Marc Valin
JSC
2011
110views more  JSC 2011»
13 years 5 months ago
Computing symmetric rank for symmetric tensors
We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for...
Alessandra Bernardi, Alessandro Gimigliano, Monica...

Dataset
832views
14 years 11 months ago
Stereograms Database of the Syntim team
Here are some calibrated stereograms (stereo images) used in the Syntim team to test our 3D vision algorithms. Calibration data are available, assuming a pin-hole camera model. Ple...
J.-P. Tarel and J.-M. Vézien
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 11 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin