2542 search results - page 380 / 509 » Computing Cartograms with Optimal Complexity |
118
Voted
DAC
2004
ACM
15 years 4 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
124
click to vote
SIGGRAPH
1995
ACM
15 years 4 months ago
1995
ACM
Recent advances in computer graphics have produced images approaching the elusive goal of photorealism. Since many natural objects are so complex and detailed, they are often not ...
103
Voted
AINA
2006
IEEE
15 years 2 months ago
2006
IEEE
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
104
Voted
CCCG
2007
15 years 2 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
91
Voted
CCGRID
2010
IEEE
15 years 1 months ago
2010
IEEE
Current service-level agreements (SLAs) offered by cloud providers do not make guarantees about response time of Web applications hosted on the cloud. Satisfying a maximum average ...