2542 search results - page 77 / 509 » Computing Cartograms with Optimal Complexity |
140
click to vote
EMMCVPR
2001
Springer
15 years 7 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
110
Voted
FCCM
1998
IEEE
15 years 6 months ago
1998
IEEE
PAM-Blox are object-oriented circuit generators on top of the PCI Pamette design environment, PamDC. High- performance FPGA design for adaptive computing is simplified by using a ...
118
Voted
ECOOP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
113
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
118
click to vote
ISPD
1998
ACM
15 years 6 months ago
1998
ACM
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...