5606 search results - page 474 / 1122 » Randomization Techniques for Graphs. |
188
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
159
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
177
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
165
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
168
click to vote
GG
2004
Springer
16 years 6 days ago
2004
Springer
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...