2485 search results - page 487 / 497 » Time Bounded Frequency Computations |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
The use of any modern computer system leaves unintended traces of expired data and remnants of users' past activities. In this paper, we investigate the unintended persistenc...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...