7006 search results - page 257 / 1402 » Approximation Algorithms |
117
Voted
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
122
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
141
Voted
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
102
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
153
Voted
HYBRID
2000
Springer
15 years 7 months ago
2000
Springer
In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is de ned by linear di erential equatio...