2542 search results - page 335 / 509 » Computing Cartograms with Optimal Complexity |
CIAC
2006
Springer
14 years 2 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
ASYNC
1997
IEEE
14 years 2 months ago
1997
IEEE
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
WSC
2008
14 years 1 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
APVIS
2007
14 years 6 days ago
2007
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
WISES
2008
14 years 4 days ago
2008
A configuration with heterogeneous sensors using different measurement approaches most likely overcome the problem of correlated measurement errors as they occur when employing a ...