Sciweavers

2636 search results - page 416 / 528
» Linear Programming
Sort
View
CORR
2010
Springer
97views Education» more  CORR 2010»
14 years 10 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
CVIU
2008
109views more  CVIU 2008»
14 years 10 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
COMCOM
2006
283views more  COMCOM 2006»
14 years 10 months ago
Sleep scheduling for wireless sensor networks via network flow model
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost...
Rick W. Ha, Pin-Han Ho, Sherman X. Shen, Junshan Z...
COR
2006
113views more  COR 2006»
14 years 10 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
CORR
2006
Springer
100views Education» more  CORR 2006»
14 years 10 months ago
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
Peyman Razaghi, Wei Yu