1403 search results - page 70 / 281 » About Approximations of Exponentials |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
129
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
110
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
109
click to vote
PLDI
2012
ACM
13 years 3 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
116
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...