2233 search results - page 152 / 447 » On the Complexity of Theory Curbing |
158
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
209
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
156
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
147
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
152
click to vote
HT
2009
ACM
16 years 28 days ago
2009
ACM
This paper proposes an approach to comparison of spatial hypertext collections which avoids becoming entangled in complexities of version management and merging. We also propose a...