1830 search results - page 157 / 366 » Workshop on Graph Computation Models |
132
click to vote
CONCUR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
154
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
151
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
157
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
161
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...