500 search results - page 53 / 100 » Approximation algorithms for maximum independent set of pseu... |
127
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
102
click to vote
SSS
2009
Springer
15 years 6 months ago
2009
Springer
We propose a communication scheme for GALS systems with independent but approximately synchronized clock sources, which guarantees high-speed metastability-free communication betwe...
126
Voted
SIAMJO
2008
15 years 1 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
104
Voted
ESA
2006
Springer
15 years 5 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
111
Voted
SSDBM
2005
IEEE
15 years 7 months ago
2005
IEEE
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...