Sciweavers

690 search results - page 33 / 138
» Dense Admissible Sets
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
A Joint Design of Distributed QoS Scheduling and Power Control for Wireless Networks
— The capacity of a power controlled wireless network can be changing due to user’s mobility, fading or shadowing effects. As a result, the quality of service (QOS) of users ac...
Chun-Chia Chen, Duan-Shin Lee
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 2 months ago
Closed-loop optimal experiment design: The partial correlation approach
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
Roland Hildebrand, Michel Gevers, Gabriel Solari
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 3 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
14 years 4 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
RTCSA
2000
IEEE
13 years 11 months ago
Efficient resource management for hard real-time communication over differentiated services architectures
We propose an efficient strategy for resource management for scalable QoS guaranteed real-time communication services. This strategy is based on sink trees, and is particularly we...
Byung-Kyu Choi, Riccardo Bettati