Sciweavers

44 search results - page 3 / 9
» Maximizing the Number of Packed Rectangles
Sort
View
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 1 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
ICDT
2001
ACM
124views Database» more  ICDT 2001»
13 years 11 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
EJC
2010
13 years 7 months ago
Packing sets of patterns
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we ...
Alexander Burstein, Peter Hästö
CCCG
2009
13 years 8 months ago
The Bichromatic Rectangle Problem in High Dimensions
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
Jonathan Backer, J. Mark Keil
ESA
2007
Springer
150views Algorithms» more  ESA 2007»
14 years 1 months ago
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...
Amos Israeli, Dror Rawitz, Oran Sharon