Sciweavers

2976 search results - page 217 / 596
» On the bounded integer programming
Sort
View
ICIP
1995
IEEE
16 years 8 months ago
A lattice vector quantizer for generalized Gaussian sources
A fixed-rate lattice vector quantizer for generalized Gaussian (GG) sources is presented. By using the contour of counstant probability of a generalized Gaussian source to bound t...
Feng Chen, Zheng Gao, John D. Villasenor
ISPAN
2005
IEEE
16 years 2 days ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
IPPS
2002
IEEE
15 years 11 months ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim
AAAI
2006
15 years 8 months ago
Weighted Constraint Satisfaction with Set Variables
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
J. H. M. Lee, C. F. K. Siu
CORR
2011
Springer
162views Education» more  CORR 2011»
15 years 1 months ago
Helly numbers of acyclic families
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
Éric Colin de Verdière, Grégo...