7150 search results - page 16 / 1430 » An Approximation Algorithm for Approximation Rank |
101
Voted
JSCIC
2010
14 years 7 months ago
2010
We discuss the approximation of the meanfield terms appearing in computations of the multi-configuration time-dependent Hartree
117
Voted
AIRWEB
2008
Springer
15 years 2 months ago
2008
Springer
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
135
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
IPL
2007
15 years 9 days ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
129
Voted
PODS
2012
ACM
13 years 2 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...