Sciweavers

94 search results - page 5 / 19
» A branch and bound algorithm for the matrix bandwidth minimi...
Sort
View
ESORICS
2000
Springer
13 years 11 months ago
A Full Bandwidth ATM Firewall
The ATM technology has been specified to provide users with the ability to request quality of service (QoS) for their applicatio ns and to enable high speed communications. Howeve...
Olivier Paul, Maryline Laurent, Sylvain Gombault
MEDIAFORENSICS
2010
13 years 8 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
IM
2007
13 years 7 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 7 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
INFOCOM
2007
IEEE
14 years 1 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo