Sciweavers

1068 search results - page 41 / 214
» Factorization as a Rank 1 Problem
Sort
View
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
14 years 11 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
15 years 3 months ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu
ICST
2011
IEEE
14 years 1 months ago
EFindBugs: Effective Error Ranking for FindBugs
—Static analysis tools have been widely used to detect potential defects without executing programs. It helps programmers raise the awareness about subtle correctness issues in t...
Haihao Shen, Jianhong Fang, Jianjun Zhao
CVPR
2012
IEEE
13 years 6 days ago
Robust late fusion with rank minimization
In this paper, we propose a rank minimization method to fuse the predicted confidence scores of multiple models, each of which is obtained based on a certain kind of feature. Spe...
Guangnan Ye, Dong Liu, I-Hong Jhuo, Shih-Fu Chang
ESSMAC
2003
Springer
15 years 3 months ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...