4009 search results - page 482 / 802 » Clustering on Complex Graphs |
122
click to vote
ICCD
2000
IEEE
16 years 3 months ago
2000
IEEE
In this paper, we present a fast and eficient compilation methodology for pipeline reconfigurable architectures. Our compiler back-end is much faster than conventional CAD tools, ...
179
click to vote
ASAP
2007
IEEE
16 years 1 months 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 ...
150
click to vote
ICASSP
2007
IEEE
16 years 1 months 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...
181
click to vote
VR
2007
IEEE
16 years 29 days ago
2007
IEEE
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
181
click to vote
SOFSEM
2007
Springer
16 years 25 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 ...