359 search results - page 28 / 72 » Solving Geometric Covering Problems by Data Reduction |
SIGGRAPH
2000
ACM
14 years 16 days ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
EUROCAST
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this work we consider the application of metaheuristic algorithms to the problem of fitting rectangular signals to time-data series. The application background is to ...
ICOIN
2005
Springer
14 years 2 months ago
2005
Springer
Multi-hop ad hoc wireless networks generally use the IEEE 802.11 Distributed Coordination Function (DCF) MAC protocol, which utilizes the request-to-send/clear-to-send (RTS/CTS) me...
DOCENG
2009
ACM
14 years 26 days ago
2009
ACM
We review the literature on automatic document formatting with an emphasis on recent work in the field. One common way to frame document formatting is as a constrained optimizatio...