1920 search results - page 339 / 384 » The Range Constraint: Algorithms and Implementation |
141
Voted
ISPD
2000
ACM
15 years 8 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...
140
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
140
Voted
PAMI
2011
14 years 10 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
137
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
148
click to vote
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...