7150 search results - page 30 / 1430 » An Approximation Algorithm for Approximation Rank |
125
click to vote
JDA
2008
15 years 4 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
129
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a produ...
130
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
141
click to vote
SIGCOMM
2006
ACM
15 years 10 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
148
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...