Sciweavers

1672 search results - page 36 / 335
» Tightness problems in the plane
Sort
View
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 2 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...
SIGMETRICS
2004
ACM
141views Hardware» more  SIGMETRICS 2004»
14 years 1 months ago
Spatio-temporal available bandwidth estimation with STAB
We study the problem of locating in space and over time a network path’s tight link, that is the link with the least available bandwidth on the path. Tight link localization ben...
Vinay J. Ribeiro, Rudolf H. Riedi, Richard G. Bara...
ICPR
2002
IEEE
14 years 8 months ago
Projective Factorization of Planes and Cameras in Multiple Views
This paper proposes a novel method for the projective reconstruction of planes and cameras from multiple images by factorizing a matrix containing all planar homographies between ...
Carsten Rother, Stefan Carlsson, Dennis Tell
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 1 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
BMVC
2002
13 years 10 months ago
Detecting Planes In An Uncalibrated Image Pair
Plane detection is a prerequisite to a wide variety of vision tasks. This paper proposes a novel method that exploits results from projective geometry to automatically detect plan...
Manolis I. A. Lourakis, Antonis A. Argyros, Stelio...