Sciweavers

1305 search results - page 245 / 261
» An Optimization Algorithm Based on Active and Instance-Based...
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 29 days 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...
CIKM
2010
Springer
13 years 5 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
TIP
2008
153views more  TIP 2008»
13 years 8 months ago
Hierarchical Color Correction for Camera Cell Phone Images
In this paper, we propose a hierarchical color correction algorithm for enhancing the color of digital images obtained from low quality digital image capture devices such as cell ...
Hasib Siddiqui, Charles A. Bouman
CVPR
2012
IEEE
11 years 11 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
15 years 3 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox