2304 search results - page 245 / 461 » On the Vulnerability of Large Graphs |
172
click to vote
WEA
2005
Springer
16 years 3 days ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
197
click to vote
NAACL
2010
15 years 4 months ago
2010
We examine the viability of building large polarity lexicons semi-automatically from the web. We begin by describing a graph propagation framework inspired by previous work on con...
215
click to vote
ACL
2011
14 years 10 months ago
2011
We describe a new approach to disambiguating semantic frames evoked by lexical predicates previously unseen in a lexicon or annotated data. Our approach makes use of large amounts...
196
Voted
BMCBI
2006
15 years 6 months ago
2006
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
201
click to vote
ECCC
2010
15 years 4 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...