Sciweavers

58 search results - page 12 / 12
» What Can We Learn from Discrete Images about the Continuous ...
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 9 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
BIOADIT
2004
Springer
13 years 10 months ago
The Genealogy of Biomimetics: Half a Century?s Quest for Dynamic IT
Abstract. Biologically inspired approaches to the design of general IT are presently flourishing. Investigating the scientific and historical roots of the tendency will serve to pr...
Mikkel Holm Sørensen
ECCV
2010
Springer
13 years 10 months ago
Backprojection Revisited: Scalable Multi-view Object Detection and Similarity Metrics for Detections
Hough transform based object detectors learn a mapping from the image domain to a Hough voting space. Within this space, object hypotheses are formed by local maxima. The votes con...