1346 search results - page 159 / 270 » On the number of rectangular partitions |
114
click to vote
PRL
2008
15 years 1 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
TCOM
2008
15 years 1 months ago
2008
This paper formulates power allocation policies that maximize the region of mutual informations achievable in multiuser downlink OFDM channels. Arbitrary partitioning of the availa...
106
click to vote
JCO
2007
15 years 1 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
CN
2004
15 years 1 months ago
2004
Texture and temporal variations in scenes, and peculiarities of MPEG compression algorithms result in very complex frame-size data sets for any long-duration variable bit rate (VB...
100
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...