3702 search results - page 134 / 741 » All Pairings Are in a Group |
160
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
149
click to vote
JDA
2007
15 years 6 months ago
2007
Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where...
147
click to vote
ACL
2010
15 years 4 months ago
2010
We present a discriminative model that directly predicts which set of phrasal translation rules should be extracted from a sentence pair. Our model scores extraction sets: nested ...
162
click to vote
TWC
2010
15 years 1 months ago
2010
We consider a multiuser two-way relay network where multiple pairs of users exchange information with the assistance of a relay node, using orthogonal channels per pair. For a vari...
152
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Re-Pair is a dictionary-based compression method invented in 1999 by Larsson and Moffat. Although its practical performance has been established through experiments, the method ha...