2542 search results - page 80 / 509 » Computing Cartograms with Optimal Complexity |
109
Voted
DAC
2009
ACM
16 years 3 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
159
Voted
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
118
Voted
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
155
Voted
RIVF
2008
15 years 4 months ago
2008
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
113
click to vote
DAC
2003
ACM
16 years 3 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...