Sciweavers

3341 search results - page 538 / 669
» On Bounded Queries and Approximation
Sort
View
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
15 years 2 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
Vladimir Braverman and Rafail Ostrovsky
ICC
2007
IEEE
127views Communications» more  ICC 2007»
15 years 1 months ago
Spectral Efficiency of Channel-Aware Schedulers in Non-Identical Composite Links with Interference
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...
Jingxian Wu, Neelesh B. Mehta, Andreas F. Molisch,...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
COMPGEOM
2008
ACM
14 years 11 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
AIPS
2009
14 years 11 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...