68 search results - page 4 / 14 » Computing Graph Roots Without Short Cycles |
DM
2010
13 years 7 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper applies a segmented matched filter for acquiring chip codephase alignment in direct-sequence CDMA packet communications. This alignment is essential for decoding the sp...
IEEEPACT
2003
IEEE
14 years 24 days ago
2003
IEEE
We present a technique for reducing the power dissipation in the course of writebacks and committments in a datapath that uses a dedicated architectural register file (ARF) to hol...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...
IACR
2011
12 years 7 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...