92 search results - page 6 / 19 » Computing the Shortest Essential Cycle |
COCOON
2010
Springer
14 years 4 days ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Abstract { This paper presents the machine description language LISA for the generation of bitand cycle accurate models of DSP processors. Based on a behavioral operation descripti...
ISCAPDCS
2001
13 years 8 months ago
2001
The implementation of modern high performance computer is increasingly directed toward parallelism in the hardware. However, most of the current fetch units are limited to one bra...
SIAMCOMP
2000
13 years 7 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
ICB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...