3019 search results - page 172 / 604 » Approximating the Domatic Number |
216
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
196
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
178
click to vote
PROPERTYTESTING
2010
15 years 4 months ago
2010
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
205
click to vote
WISA
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we present two attacks that exploit cache events, which are visible in some side channel, to derive a secret key used in an implementation of AES. The first is an imp...
190
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...