Sciweavers

1405 search results - page 29 / 281
» Popularity at Minimum Cost
Sort
View
CIC
2006
114views Communications» more  CIC 2006»
14 years 11 months ago
Tree Based Conference Key Establishment Cost Analysis and Minimization in Heterogeneous Networks
A shared secret, conference key, must be established among members to securely communicate among them. The Diffie-Hellman is often used for the conference key establishment. In a ...
Zhan Liu, Mi Lu
BMVC
2010
14 years 7 months ago
TV-Based Multi-Label Image Segmentation with Label Cost Prior
This paper studies image segmentation based on the minimum description length (MDL) functional combining spatial regularization with a penality for the number of distinct segments...
Jing Yuan, Yuri Boykov
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
14 years 11 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
ICC
2009
IEEE
121views Communications» more  ICC 2009»
14 years 7 months ago
Designing Demand-Wise Shared Protection Networks with Specified Minimum Dual-Failure Restorability
-- We develop a new integer linear programming model to optimally design demand-wise shared protection (DSP) networks to achieve specified minimum levels of dual-failure restorabil...
Jude Akpuh, John Doucette