Sciweavers

985 search results - page 179 / 197
» Piercing Convex Sets
Sort
View
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
CVPR
2003
IEEE
14 years 9 months ago
Face Recognition Under Variable Lighting using Harmonic Image Exemplars
We propose a new approach for face recognition under arbitrary illumination conditions, which requires only one training image per subject (if there is no pose variation) and no 3...
Lei Zhang 0002, Dimitris Samaras
CVPR
2008
IEEE
14 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
FOCS
2007
IEEE
14 years 2 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
MLG
2007
Springer
14 years 1 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich