Sciweavers

1100 search results - page 9 / 220
» Approximate distance oracles
Sort
View
ENTCS
2008
73views more  ENTCS 2008»
13 years 8 months ago
Oracle-Based Partial Evaluation
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
Claudio Ochoa, Germán Puebla
ATAL
2011
Springer
12 years 8 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
EOR
2007
99views more  EOR 2007»
13 years 8 months ago
Learning lexicographic orders
The purpose of this paper is to learn the order of criteria of lexicographic decision under various reasonable assumptions. We give a sample evaluation and an oracle based algorit...
József Dombi, Csanád Imreh, Ná...
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
FCT
2001
Springer
14 years 28 days ago
The Complexity of Maximum Matroid-Greedoid Intersection
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
Taneli Mielikäinen, Esko Ukkonen