1493 search results - page 227 / 299 » Local resilience of graphs |
EMMCVPR
2001
Springer
14 years 22 days ago
2001
Springer
—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 associati...
VISUALIZATION
2000
IEEE
14 years 18 days ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
IPPS
1999
IEEE
14 years 16 days ago
1999
IEEE
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
ISCAS
1999
IEEE
14 years 16 days ago
1999
IEEE
In this paper, we present the application of dynamic trellis diagrams (DTDs) to automatic translation of data flow graphs (DFGs) into highly optimized programs for digital signal ...
PODC
2010
ACM
14 years 4 days ago
2010
ACM
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...