Sciweavers

26354 search results - page 53 / 5271
» How we refactor, and how we know it
Sort
View
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 10 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
ANOR
2008
96views more  ANOR 2008»
13 years 9 months ago
How good are SPT schedules for fair optimality criteria
Abstract We consider the following scheduling setting: a set of
Eric Angel, Evripidis Bampis, Fanny Pascual
COMCOM
2006
75views more  COMCOM 2006»
13 years 9 months ago
SSL/TLS session-aware user authentication - Or how to effectively thwart the man-in-the-middle
Abstract. Man-in-the-middle attacks pose a serious threat to SSL/TLSbased electronic commerce applications, such as Internet banking. In this paper, we argue that most deployed use...
Rolf Oppliger, Ralf Hauser, David A. Basin
BC
2000
47views more  BC 2000»
13 years 8 months ago
How do insects use path integration for their navigation?
We combine experimental
Matthew Collett, Thomas S. Collett
LATINCRYPT
2010
13 years 7 months ago
How Leaky Is an Extractor?
This paper discusses the security of a leakage-resilient stream cipher presented at FOCS 2008, instantiated in a practical setting. Based on a case study, we put forward implementa...
François-Xavier Standaert