Sciweavers

478 search results - page 50 / 96
» Improving probability bounds by optimization over subsets
Sort
View
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
FOCS
1997
IEEE
13 years 12 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
JSAC
2006
146views more  JSAC 2006»
13 years 7 months ago
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks
Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. E...
Mansoor Alicherry, Randeep Bhatia, Erran L. Li
STACS
2005
Springer
14 years 1 months ago
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
Nir Ailon, Bernard Chazelle
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna