Sciweavers

342 search results - page 10 / 69
» Constrained Integer Partitions
Sort
View
DAM
2008
85views more  DAM 2008»
13 years 8 months ago
On the complexity of constrained VC-classes
Sauer's Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x [n] with h(x) = 1, where th...
Joel Ratsaby
SAINT
2008
IEEE
14 years 2 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
FTSIG
2008
102views more  FTSIG 2008»
13 years 8 months ago
Set Partition Coding: Part I of Set Partition Coding and Image Wavelet Coding Systems
The purpose of this two-part monograph is to present a tutorial on set partition coding, with emphasis and examples on image wavelet transform coding systems, and describe their u...
William A. Pearlman, Amir Said
DM
2000
99views more  DM 2000»
13 years 8 months ago
Chromatically unique bipartite graphs with low 3-independent partition numbers
For integers p; q; s with p
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
JDA
2006
83views more  JDA 2006»
13 years 8 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki