3055 search results - page 558 / 611 » Randomized Search Trees |
108
click to vote
IVC
2007
15 years 2 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
116
Voted
JAIR
2007
15 years 2 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
125
Voted
JAIR
2007
15 years 2 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
103
click to vote
AIR
2004
15 years 2 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
135
click to vote
VR
2008
IEEE
15 years 2 months ago
2008
IEEE
We present a new technique for managing visual clutter caused by overlapping labels in complex information displays. This technique, "label layering", utilizes stereosco...