Sciweavers

CVPR
2012
IEEE
13 years 7 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos
CVPR
2012
IEEE
13 years 7 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
CVPR
2012
IEEE
13 years 7 months ago
Light field denoising, light field superresolution and stereo camera based refocussing using a GMM light field patch prior
With the recent availability of commercial light field cameras, we can foresee a future in which light field signals will be as common place as images. Hence, there is an immine...
Kaushik Mitra, Ashok Veeraraghavan
CVPR
2012
IEEE
13 years 7 months ago
Fan Shape Model for object detection
We propose a novel shape model for object detection called Fan Shape Model (FSM). We model contour sample points as rays of final length emanating for a reference point. As in fo...
Xinggang Wang, Xiang Bai, Tianyang Ma, Wenyu Liu, ...
CVPR
2012
IEEE
13 years 7 months ago
On partial least squares in head pose estimation: How to simultaneously deal with misalignment
Head pose estimation is a critical problem in many computer vision applications. These include human computer interaction, video surveillance, face and expression recognition. In ...
Murad Al Haj, Jordi Gonzàlez, Larry S. Davi...
SODA
2012
ACM
262views Algorithms» more  SODA 2012»
13 years 7 months ago
A polynomial-time approximation scheme for planar multiway cut
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 7 months ago
Sketching valuation functions
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu,...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 7 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 7 months ago
Constructing high order elements through subspace polynomials
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
Qi Cheng, Shuhong Gao, Daqing Wan
SODA
2012
ACM
278views Algorithms» more  SODA 2012»
13 years 7 months ago
Beyond myopic best response (in Cournot competition)
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yish...