250 search results - page 36 / 50 » Constructing a Class of Symmetric Graphs |
NAACL
2010
13 years 6 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CC
2006
Springer
14 years 7 days ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
TIT
2002
13 years 8 months ago
2002
Abstract-- This paper starts a systematic study of capacityachieving sequences of low-density parity-check codes for the erasure channel. We introduce a class Aof analytic function...