Sciweavers

2252 search results - page 79 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
EUROCRYPT
2001
Springer
15 years 6 months ago
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
Liam Keliher, Henk Meijer, Stafford E. Tavares
EUROPAR
2006
Springer
15 years 5 months ago
On-Line Adaptive Parallel Prefix Computation
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
Jean-Louis Roch, Daouda Traoré, Julien Bern...
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
15 years 5 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 5 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
INFOCOM
2008
IEEE
15 years 8 months ago
Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks
—A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multihop wireless networks is discussed. The goal of maximizing a utili...
Simone Merlin, Nitin H. Vaidya, Michele Zorzi