Sciweavers

561 search results - page 87 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
A Theory of Coprime Blurred Pairs
We present a new Coprime Blurred Pair (CBP) theory that may benefit a number of computer vision applications. A CBP is constructed by blurring the same latent image with two unkn...
Feng Li, Zijia Li, David Saunders, Jingyi Yu
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 6 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
14 years 1 months ago
ICSPEA: evolutionary five-axis milling path optimisation
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
Jörn Mehnen, Rajkumar Roy, Petra Kersting, To...
FOCS
2008
IEEE
14 years 2 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
CVPR
2009
IEEE
15 years 3 months ago
Robust Multi-Class Transductive Learning with Graphs
Graph-based methods form a main category of semisupervised learning, offering flexibility and easy implementation in many applications. However, the performance of these methods...
Wei Liu (Columbia University), Shih-fu Chang (Colu...