7150 search results - page 23 / 1430 » An Approximation Algorithm for Approximation Rank |
122
click to vote
IM
2007
15 years 10 days ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
192
click to vote
SIGMOD
2008
ACM
16 years 17 days ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
112
click to vote
SIAMCO
2002
15 years 2 days ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
118
click to vote
ICDE
2010
IEEE
16 years 5 days ago
2010
IEEE
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
115
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...