618 search results - page 11 / 124 » Short cycle connectivity |
ECCV
2008
Springer
15 years 7 months ago
2008
Springer
We propose a new method for detecting objects such as bags carried by pedestrians depicted in short video sequences. In common with earlier work on the same problem, the method sta...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
WIA
2009
Springer
14 years 3 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
IEEEPACT
2003
IEEE
14 years 1 months 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...
JSC
2007
13 years 8 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...