159 search results - page 14 / 32 » Computing minimum cuts by randomized search heuristics |
115
Voted
ACIVS
2008
Springer
15 years 10 months ago
2008
Springer
Multi-view scene reconstruction from multiple uncalibrated images can be solved by two stages of processing: first, a sparse reconstruction using Structure From Motion (SFM), and ...
131
Voted
AI
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
138
Voted
DAC
2004
ACM
15 years 7 months ago
2004
ACM
In a CMOS combinational logic circuit, the subthreshold leakage current in the standby state depends on the state of the inputs. In this paper we present a new approach to identif...
143
Voted
TRANSCI
2008
15 years 3 months ago
2008
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...
219
Voted
CVPR
2010
IEEE
15 years 8 days ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...