4255 search results - page 129 / 851 » Cover |
166
click to vote
TSD
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we describe a method of effective handling of linguistic data by means of covering and inhibiting patterns
178
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
175
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
159
click to vote
CCCG
2010
15 years 8 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
139
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured