Sciweavers

390 search results - page 35 / 78
» Set Intersection Theorems and Existence of Optimal Solutions
Sort
View
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 6 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
PSD
2004
Springer
132views Database» more  PSD 2004»
14 years 1 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
ICCV
2003
IEEE
14 years 9 months ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
CORR
2011
Springer
155views Education» more  CORR 2011»
12 years 11 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
ICASSP
2011
IEEE
12 years 11 months ago
Low-rank matrix completion with geometric performance guarantees
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
Wei Dai, Ely Kerman, Olgica Milenkovic