Sciweavers

1477 search results - page 9 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
78
Voted
CIMCA
2005
IEEE
15 years 3 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
ICCV
2007
IEEE
15 years 11 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
PERCOM
2006
ACM
15 years 9 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
15 years 11 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...
CONTEXT
2007
Springer
15 years 3 months ago
Context Modeling: Task Model and Practice Model
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...
Patrick Brézillon