Sciweavers

3096 search results - page 360 / 620
» The Generalized FITC Approximation
Sort
View
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
15 years 11 months ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle
ICPR
2010
IEEE
15 years 11 months ago
Object Tracking by Structure Tensor Analysis
Covariance matrices have recently been a popular choice for versatile tasks like recognition and tracking due to their powerful properties as local descriptor and their low comput...
Michael Donoser, Stefan Kluckner, Horst Bischof
COMGEO
2010
ACM
15 years 11 months ago
GIRPharma: a geographic information retrieval approach to locate pharmacies on duty
This paper describes an approximation based on geographic information retrieval with the purpose to give some solutions to the problem of searching pharmacies on duty in the Spani...
Francisco M. Rangel Pardo, Loli Rangel Pardo, Davi...
SIGECOM
2010
ACM
140views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Better vaccination strategies for better people
In this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious ...
Po-An Chen, Mary David, David Kempe
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 11 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld