Sciweavers

557 search results - page 62 / 112
» On the set multi-cover problem in geometric settings
Sort
View
ANCS
2005
ACM
14 years 2 months ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...
GIS
2006
ACM
14 years 10 months ago
Optimal BSPs and rectilinear cartograms
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
Mark de Berg, Elena Mumford, Bettina Speckmann
LATIN
2010
Springer
14 years 3 months ago
Colorful Strips
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
DCOSS
2005
Springer
14 years 2 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
INFOVIS
2003
IEEE
14 years 2 months ago
Improving Hybrid MDS with Pivot-Based Searching
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
Alistair Morrison, Matthew Chalmers