Sciweavers

2173 search results - page 238 / 435
» On the Values of Reducibility Candidates
Sort
View
WG
2007
Springer
16 years 1 months ago
Obtaining a Planar Graph by Vertex Deletion
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
Dániel Marx, Ildikó Schlotter
GLOBECOM
2006
IEEE
16 years 1 months ago
Noise Model Analysis of Optimized Mixed-Radix Structures for Pulsed OFDM
Pulsed OFDM (P-OFDM) is a proposed enhancement to Multi-Band Orthogonal Frequency Division Multiplexing which reduces the power and complexity of Ultra Wideband transceivers witho...
Kai-Chuan Chang, Gerald E. Sobelman
ICMCS
2006
IEEE
191views Multimedia» more  ICMCS 2006»
16 years 1 months ago
Human Vision System Aware Exhaustive Block-Matching Algorithm
In this work, homomorphic image modeling is used to make the exhaustive block-matching algorithm (EBMA) more human vision system (HVS) aware, thus yielding visually pleasing seque...
David Lin, Paul Chau
IROS
2006
IEEE
139views Robotics» more  IROS 2006»
16 years 1 months ago
Motion Synchronization in Mobile Robot Networks: Robustness
– Motion synchronization in mobile robot networks is a fundamental task in distributed multi-robot collaboration. In this paper, we investigate the robustness of synchronous spee...
Fei Zhang, Weidong Chen, Yugeng Xi
ISPDC
2006
IEEE
16 years 1 months ago
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
Piotr Zielinski