61 search results - page 5 / 13 » soda 2001 |
SEQLEARN
2001
Springer
15 years 4 months ago
2001
Springer
SODA
2001
ACM
15 years 1 months ago
2001
ACM
This paper describes an algorithm for maintaining an approximating triangulation of a deforming surface in
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
114
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...