552 search results - page 84 / 111 » Lower bounds for dynamic connectivity |
STOC
2010
ACM
14 years 23 days ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
SSD
2001
Springer
14 years 10 days ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
INFOCOM
1997
IEEE
14 years 3 days ago
1997
IEEE
Abstract—A multicast flow control framework for data traffic traversing both a wired and wireless network is proposed. Markov-modulated fluid (MMF) models are used for the rec...