2304 search results - page 355 / 461 » On the Vulnerability of Large Graphs |
EUROCAST
2007
Springer
15 years 1 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
105
click to vote
SODA
1992
ACM
14 years 11 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
BMCBI
2010
14 years 10 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...