186
Voted
COMPUTING
2016
10 years 1 months ago
2016
34
Voted
COMPUTABILITY
2016
10 years 1 months ago
2016
For r ∈ [0, 1] we say that a set A ⊆ ω is coarsely computable at density r if there is a computable set C such that {n : C(n) = A(n)} has lower density at least r. Let γ(A) =...
329
Voted
COMGEO
2016
ACM
10 years 1 months ago
2016
ACM
Let C = {c1, . . . , cn} be a collection of disjoint closed bounded convex sets in the plane. Suppose that one of them, say c1, represents a valuable object we want to uncover, an...
67
Voted
COMCOM
2016
10 years 1 months ago
2016
VANET has attracted a good deal of attention owing to its wide range of important applications. VANET is a special kind of mobile ad hoc network, in which most of the nodes are sp...
56
Voted
COMCOM
2016
10 years 1 months ago
2016
—Friend-to-Friend (F2F) storage systems were shown to suffer from two significant limitations. First, users with a small set of friends are penalized by lack of available storag...