Sciweavers

727 search results - page 81 / 146
» A Calculus of Bounded Capacities
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
14 years 12 days ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
MP
2008
99views more  MP 2008»
13 years 9 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
TIT
2008
73views more  TIT 2008»
13 years 8 months ago
Detection of Information Flows
Abstract-- Distributed detection of information flows by timing analysis is considered. Timing measurements are subject to perturbations and the insertion of chaff noise. Moreover,...
Ting He, Lang Tong
IJACTAICIT
2010
189views more  IJACTAICIT 2010»
13 years 6 months ago
An Improved Algorithm for Data Hiding Using HH-subband Haar Wavelet Coefficients
This paper presents an improved adaptive algorithm for enhanced data hiding under HH-subband Haar Wavelet coefficients of a gray scale host image. The algorithm uses an optimal se...
Stuti Bazaj, Sachin Modi, Anand Mohan, S. P. Singh
GLOBECOM
2008
IEEE
14 years 3 months ago
Two-Hop Secure Communication Using an Untrusted Relay: A Case for Cooperative Jamming
—We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation...
Xiang He, Aylin Yener