2252 search results - page 289 / 451 » Lower Bounds for Dynamic Algorithms |
155
Voted
WAW
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
149
Voted
DC
2010
14 years 10 months ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
155
Voted
HIPC
2000
Springer
15 years 7 months ago
2000
Springer
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
124
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
115
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...