340 search results - page 14 / 68 » ets 2009 |
SODA
2012
ACM
13 years 17 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
NAACL
2010
14 years 8 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...
81
Voted
KBSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—We investigate claims and assumptions made in several recent papers about fault localization (FL) techniques. Most of these claims have to do with evaluating FL accuracy. Our in...
88
Voted
AMSTERDAM
2009
14 years 8 months ago
2009
Potts (2005, 2007) claims that Grice's `conventional implicatures' offer a powerful argument in favor of a multidimensional semantics, one in which certain expressions fa...
AINA
2009
IEEE
14 years 8 months ago
2009
IEEE
Searching very large collections can be costly in both computation and storage. To reduce this cost, recent research has focused on reducing the size (pruning) of the inverted ind...