2251 search results - page 66 / 451 » Geometric Algorithms on CUDA |
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
Super-resolution image zooming is possible when the image has some geometric regularity. We introduce a general class of non-linear inverse estimators, which combines linear estima...
110
click to vote
MOC
2011
14 years 4 months ago
2011
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...