990 search results - page 146 / 198 » Sub-Graphs of Complete Graph |
TIT
2008
13 years 7 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...
MICCAI
2006
Springer
14 years 8 months ago
2006
Springer
Fully automatic, completely reliable segmentation in medical images is an unrealistic expectation with today's technology. However, many automatic segmentation algorithms may ...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...