2612 search results - page 226 / 523 » Switching Graphs and Their Complexity |
263
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
156
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
157
click to vote
INFOCOM
2009
IEEE
16 years 14 days ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
174
click to vote
WCNC
2008
IEEE
16 years 6 days ago
2008
IEEE
— This paper proposes a new approach for decoding LDPC codes over MISO channels. Since in an nT × 1 MISO system with a modulation of alphabet size 2M, nT transmitted symbols are...
138
click to vote
CBMS
2007
IEEE
16 years 5 days ago
2007
IEEE
This paper focuses on the problem of representing, in a meaningful way, the knowledge involved in the HealthAgents project. Our work is motivated by the complexity of representing...