Sciweavers

351 search results - page 24 / 71
» An exact method for graph coloring
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 9 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
AI
2006
Springer
13 years 11 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 2 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
FGCN
2008
IEEE
131views Communications» more  FGCN 2008»
14 years 2 months ago
Object Tracking of Mobile Robot Using Moving Color and Shape Information for the Aged Walking
A mobile robot with various types of sensors via ubiquitous networks is introduced. We designed a mobile robot composed of TCP/IP network, wireless camera and several sensors in a...
Sanghoon Kim, Sangmu Lee, Seungjong Kim