68 search results - page 8 / 14 » Computing Graph Roots Without Short Cycles |
93
Voted
JAL
2006
14 years 9 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
105
click to vote
PLDI
2011
ACM
14 years 11 days ago
2011
ACM
In this paper we propose Recon, a new general approach to concurrency debugging. Recon goes beyond just detecting bugs, it also presents to the programmer short fragments of buggy...
MSCS
2007
14 years 9 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
We propose REWIRED (REgister Write Inhibition by REsource Dedication), a technique for reducing power during high level synthesis (HLS) by selectively inhibiting the storage of fun...
82
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...