Sciweavers

710 search results - page 81 / 142
» On Minimum Power Connectivity Problems
Sort
View
FORMATS
2007
Springer
14 years 4 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
GLOBECOM
2006
IEEE
14 years 4 months ago
Topology Control for Constant Rate Mobile Networks
Abstract— Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is throu...
Liang Zhao, Errol L. Lloyd, S. S. Ravi
INFOCOM
2003
IEEE
14 years 3 months ago
An information theoretic view of network management
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
Tracey Ho, Muriel Médard, Ralf Koetter
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
PODS
2012
ACM
276views Database» more  PODS 2012»
12 years 15 days ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang