Sciweavers

26782 search results - page 5338 / 5357
» The Importance of Importance
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 12 days ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 12 days ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
CVPR
2012
IEEE
13 years 12 days ago
Discriminately decreasing discriminability with learned image filters
In machine learning and computer vision, input signals are often filtered to increase data discriminability. For example, preprocessing face images with Gabor band-pass filters ...
Jacob Whitehill, Javier R. Movellan
CVPR
2012
IEEE
13 years 11 days ago
Classifying covert photographs
The advances in image acquisition techniques make recording images never easier and brings a great convenience to our daily life. It raises at the same time the issue of privacy p...
Haitao Lang, Haibin Ling
CVPR
2012
IEEE
13 years 11 days ago
Geodesic flow kernel for unsupervised domain adaptation
In real-world applications of visual recognition, many factors—such as pose, illumination, or image quality—can cause a significant mismatch between the source domain on whic...
Boqing Gong, Yuan Shi, Fei Sha, Kristen Grauman
« Prev « First page 5338 / 5357 Last » Next »