1629 search results - page 169 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ICIAP
1999
ACM
15 years 2 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
SAC
2008
ACM
14 years 10 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
CPAIOR
2006
Springer
15 years 18 days ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
EVOW
2003
Springer
15 years 3 months ago
2003
Springer
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
ICDM
2005
IEEE
15 years 4 months ago
2005
IEEE
We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a...