2125 search results - page 255 / 425 » On Graph Complexity |
145
click to vote
ICASSP
2008
IEEE
16 years 27 days ago
2008
IEEE
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
146
click to vote
ICASSP
2008
IEEE
16 years 27 days ago
2008
IEEE
In this paper, we study non-binary regular LDPC cycle codes whose parity check matrix has fixed column weight 2 and fixed row weight d. We prove that the parity check matrix of ...
178
click to vote
LACL
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
191
click to vote
SG
2010
Springer
15 years 11 months ago
2010
Springer
While many visualization tools exist that offer sophisticated functions for charting complex data, they still expect users to possess a high degree of expertise in wielding the to...
163
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...