Sciweavers

777 search results - page 105 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
FOCS
1993
IEEE
14 years 24 days ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 7 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
CCS
2009
ACM
14 years 3 months ago
A framework for quantitative security analysis of machine learning
We propose a framework for quantitative security analysis of machine learning methods. Key issus of this framework are a formal specification of the deployed learning model and a...
Pavel Laskov, Marius Kloft
CONCUR
1997
Springer
14 years 25 days ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler