6740 search results - page 1323 / 1348 » An s -Hamiltonian Line Graph Problem |
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
ACIVS
2008
Springer
14 years 2 months ago
2008
Springer
Multi-view scene reconstruction from multiple uncalibrated images can be solved by two stages of processing: first, a sparse reconstruction using Structure From Motion (SFM), and ...