721 search results - page 32 / 145 » Graphs with Large Obstacle Numbers |
CAV
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
WPES
2006
ACM
14 years 3 months ago
2006
ACM
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
BMCBI
2008
13 years 9 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
INFOCOM
2012
IEEE
12 years 1 days ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...