Sciweavers

IMC
2007
ACM
13 years 11 months ago
Passive online rogue access point detection using sequential hypothesis testing with TCP ACK-pairs
Rogue (unauthorized) wireless access points pose serious security threats to local networks. In this paper, we propose two online algorithms to detect rogue access points using se...
Wei Wei, Kyoungwon Suh, Bing Wang, Yu Gu, Jim Kuro...
ALT
2010
Springer
13 years 11 months ago
A Regularization Approach to Metrical Task Systems
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder...
FM
2008
Springer
171views Formal Methods» more  FM 2008»
13 years 11 months ago
Assume-Guarantee Verification for Interface Automata
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
Michael Emmi, Dimitra Giannakopoulou, Corina S. Pa...
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
13 years 11 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 11 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
FAW
2008
Springer
110views Algorithms» more  FAW 2008»
13 years 11 months ago
Estimating Hybrid Frequency Moments of Data Streams
Sumit Ganguly, Mohit Bansal, Shruti Dube
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
13 years 11 months ago
Efficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 11 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
FAW
2008
Springer
117views Algorithms» more  FAW 2008»
13 years 11 months ago
Characterizing and Computing Minimal Cograph Completions
Daniel Lokshtanov, Federico Mancini, Charis Papado...
FAW
2008
Springer
90views Algorithms» more  FAW 2008»
13 years 11 months ago
Computer Science in the Information Age
John E. Hopcroft