17185 search results - page 3021 / 3437 » Computational and Quantitative Studies |
226
Voted
PODC
2009
ACM
16 years 2 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
247
click to vote
WISEC
2009
ACM
2009
ACM
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
16 years 2 months ago
Recent studies show that network coding can provide significant benefits to network protocols, such as increased throughput, reduced network congestion, higher reliability, and ...
230
Voted
CCS
2009
ACM
16 years 2 months ago
2009
ACM
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
221
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
218
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...