51 search results - page 1 / 11 » The Packing Property |
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
IPL
2008
13 years 5 months ago
2008
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
IPCO
1998
13 years 6 months ago
1998
A clutter
MVA
1992
13 years 6 months ago
1992
In this study, we explore the domain of orthogonal transforms, in order to bring an understanding on the characterization of image features, with emphasis placed on the Karhunen-L...
DCG
2006
13 years 5 months ago
2006
This paper gives n-dimensional analogues of the Apollonian circle packings in Parts I and II. Those papers considered circle packings described in terms of their Descartes configur...