Sciweavers

966 search results - page 80 / 194
» Small Alliances in Graphs
Sort
View
UC
2005
Springer
14 years 2 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
DCC
2010
IEEE
14 years 1 months ago
Tanner Graph Based Image Interpolation
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...
Ruiqin Xiong, Wen Gao
ICRA
2000
IEEE
129views Robotics» more  ICRA 2000»
14 years 1 months ago
Data Association for Mobile Robot Navigation: A Graph Theoretic Approach
Data association is the process of relating features observed in the environment to features viewed previously or to features in a map. Correct feature association is essential fo...
Tim Bailey, Eduardo Mario Nebot, Julio Rosenblatt,...
PDPTA
2007
13 years 10 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
13 years 10 months ago
Scalable Name Disambiguation using Multi-level Graph Partition
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
Byung-Won On, Dongwon Lee