4212 search results - page 249 / 843 » On Compressible Pairings and Their Computation |
161
click to vote
ECEASST
2010
15 years 4 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
175
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
In this paper we investigate a computational model of word learning that is cognitively plausible. The model is partly trained on incorrect form-referent pairings, modelling the i...
303
click to vote
CCECE
2011
IEEE
14 years 6 months ago
2011
IEEE
—An array of resistively and capacitively shunted Josephson junctions with nonsinusoidal currentphase relation is considered for modelling the resistive transition in high-Tc sup...
179
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
153
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...