Sciweavers

2542 search results - page 335 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
14 years 2 months ago
Covering a Set of Points with a Minimum Number of Lines
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...
Magdalene Grantson, Christos Levcopoulos
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
14 years 2 months ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
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...
Wendy Belluomini, Chris J. Myers
WSC
2008
14 years 1 months ago
Efficient simulation for tail probabilities of Gaussian random fields
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...
Robert J. Adler, Jose Blanchet, Jingchen Liu
APVIS
2007
14 years 6 days ago
Labeling collinear sites
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 ...
Michael A. Bekos, Michael Kaufmann, Antonios Symvo...
WISES
2008
14 years 4 days ago
Fusion of heterogeneous sensors data
A configuration with heterogeneous sensors using different measurement approaches most likely overcome the problem of correlated measurement errors as they occur when employing a ...
Wilfried Elmenreich, Robert Leidenfrost