2125 search results - page 228 / 425 » On Graph Complexity |
172
click to vote
ASAP
2007
IEEE
16 years 25 days ago
2007
IEEE
In this paper, we present and analyze a novel decoder architecture for LDPC convolutional codes (LDPCCCs). The proposed architecture enables high throughput and can be programmed ...
148
click to vote
ICASSP
2007
IEEE
16 years 25 days ago
2007
IEEE
We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...
173
click to vote
SOFSEM
2007
Springer
16 years 18 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
160
click to vote
CP
2005
Springer
16 years 22 hour ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
162
click to vote
EUROGP
2005
Springer
16 years 15 hour ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...