3495 search results - page 47 / 699 » On the random satisfiable process |
113
click to vote
RSA
2000
15 years 28 days ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
119
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Conditional Random Fields (CRFs) are a state-of-the-art approach to natural language processing tasks like grapheme-tophoneme (g2p) conversion which is used to produce pronunciati...
FUIN
2008
15 years 1 months ago
2008
In the first part of this paper we extend the semantical framework proposed in [22] for process and causality semantics of Petri nets by an additional aim, firstly mentioned in the...
108
click to vote
APN
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we complete the semantical framework proposed in [12] for process and causality semantics of Petri nets by an additional aim and develop process and causality semanti...
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...