2612 search results - page 427 / 523 » Assemblies as Graph Processes |
127
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
112
click to vote
ISPD
2000
ACM
15 years 5 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
118
click to vote
SIGGRAPH
1997
ACM
15 years 4 months ago
1997
ACM
Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for inte...
133
Voted
ACMSE
2007
ACM
15 years 4 months ago
2007
ACM
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
108
Voted
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...