2188 search results - page 135 / 438 » Instance-Optimal Geometric Algorithms |
155
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Grassmannian beamforming is an efficient way to quantize channel state information in multiple-input multiple-output wireless systems. Unfortunately, multiuser systems require la...
184
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper presents a novel approach for estimating the shortest
Euclidean distance from a given point to the corresponding
implicit quadric fitting surface. It first estimates t...
188
click to vote
CGF
2010
15 years 1 months ago
2010
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
171
click to vote
IROS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— This paper describes an efficient method for retrieving the 3-dimensional shape associated to novelties in the environment of an autonomous robot, which is equipped wi...
164
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...