Sciweavers

833 search results - page 78 / 167
» Geometric Optimization
Sort
View
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 9 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
CGF
2004
144views more  CGF 2004»
13 years 7 months ago
Crowd of Virtual Humans: a New Approach for Real Time Navigation in Complex and Structured Environments
The navigation activity is an every day practice for any human being capable of locomotion. Our objective in this work is to reproduce this crucial human activity inside virtual e...
Fabrice Lamarche, Stéphane Donikian
TSMC
2002
119views more  TSMC 2002»
13 years 7 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
13 years 5 months ago
The asymmetric sinistral/dextral Markov-Dubins problem
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
Efstathios Bakolas, Panagiotis Tsiotras
INFOCOM
2010
IEEE
13 years 6 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis