Sciweavers

2215 search results - page 389 / 443
» Wide open spaces
Sort
View
ICML
2000
IEEE
14 years 9 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 9 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 6 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
TABLEAUX
2009
Springer
14 years 3 months ago
A Novel Architecture for Situation Awareness Systems
Situation Awareness (SA) is the problem of comprehending elements of an environment within a volume of time and space. It is a crucial factor in decision-making in dynamic environm...
Franz Baader, Andreas Bauer 0002, Peter Baumgartne...
IMC
2009
ACM
14 years 3 months ago
Triangle inequality variations in the internet
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by findi...
Cristian Lumezanu, Randolph Baden, Neil Spring, Bo...