7150 search results - page 8 / 1430 » An Approximation Algorithm for Approximation Rank |
101
click to vote
STOC
2009
ACM
16 years 29 days ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
STACS
2001
Springer
15 years 4 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
ICWS
2009
IEEE
15 years 9 months ago
2009
IEEE
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
109
click to vote
WAW
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
111
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...