Sciweavers

2251 search results - page 48 / 451
» Geometric Algorithms on CUDA
Sort
View
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 4 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
ACSC
2003
IEEE
15 years 3 months ago
Path-Planning by Tessellation of Obstacles
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
Tane Pendragon, R. Lyndon While
ICPR
2002
IEEE
15 years 10 months ago
A Note on Principal Point Estimability
We provide elementary geometric arguments to show that the principal point of cameras with small to moderate field of view cannot be reliably estimated from natural, noisy images ...
Alberto Ruiz, Ginés García-Mateos, P...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
PODC
2003
ACM
15 years 3 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...