1420 search results - page 180 / 284 » Representation of Graphs by OBDDs |
130
click to vote
NAACL
2007
15 years 8 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
171
click to vote
FTCS
1998
15 years 7 months ago
1998
The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
151
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
144
click to vote
EOR
2008
15 years 6 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...