Sciweavers

4378 search results - page 698 / 876
» On the Complexity of Ordered Colourings
Sort
View
TCOM
2010
83views more  TCOM 2010»
15 years 1 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...
TCS
2010
15 years 1 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
TEC
2010
203views more  TEC 2010»
15 years 1 months ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li
TIP
2010
111views more  TIP 2010»
15 years 1 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
TSMC
2010
15 years 1 months ago
Interactive Teaching for Vision-Based Mobile Robots: A Sensory-Motor Approach
Abstract--For the last decade, we have developed a visionbased architecture for mobile robot navigation. Our bio-inspired model of the navigation has proved to achieve sensory-moto...
Christophe Giovannangeli, Philippe Gaussier