Sciweavers

1206 search results - page 139 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
COLING
1996
15 years 5 months ago
Processing Metonymy- a Domain-Model Heuristic Graph Traversal Approach
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a co...
Jacques Bouaud, Bruno Bachimont, Pierre Zweigenbau...
FCT
1995
Springer
15 years 7 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
NIPS
2001
15 years 5 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
ICDE
2007
IEEE
89views Database» more  ICDE 2007»
15 years 8 months ago
A Flexible Query Graph Based Model for the Efficient Execution of Continuous Queries
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
Yijian Bai, Hetal Thakkar, Haixun Wang, Carlo Zani...
CVIU
2011
14 years 7 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...