Sciweavers

3415 search results - page 564 / 683
» Lower Bounds for Kernelizations
Sort
View
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
15 years 5 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 5 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
CCCG
2008
15 years 5 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
SDM
2010
SIAM
128views Data Mining» more  SDM 2010»
15 years 5 months ago
Publishing Skewed Sensitive Microdata
A highly skewed microdata contains some sensitive attribute values that occur far more frequently than others. Such data violates the "eligibility condition" assumed by ...
Yabo Xu, Ke Wang, Ada Wai-Chee Fu, Raymond Chi-Win...
FORTE
2007
15 years 5 months ago
The DHCP Failover Protocol: A Formal Perspective
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...
Rui Fan, Ralph E. Droms, Nancy D. Griffeth, Nancy ...