2314 search results - page 260 / 463 » Minimal Partitions of a Graph |
124
click to vote
VRML
1998
ACM
15 years 8 months ago
1998
ACM
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...
133
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
138
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
146
click to vote
DAC
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
146
click to vote
IPMI
2007
Springer
16 years 5 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...