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...
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...
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 ...
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...
Dmitry Ponomarev, Gurhan Kucuk, Oguz Ergin, Kanad ...
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 ...