The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Abstract— While the most accurate solution to off-line structure from motion (SFM) problems is undoubtedly to extract as much correspondence information as possible and perform g...
Hauke Strasdat, J. M. M. Montiel, Andrew J. Daviso...
Keyword search in XML repositories is a powerful tool for interactive data exploration. Much work has recently been done on making XML search aware of relationship information emb...
Andrey Balmin, Latha S. Colby, Emiran Curtmola, Qu...
Identifying hot spots of moving vehicles in an urban area is essential to many smart city applications. The practical research on hot spots in smart city presents many unique feat...
Siyuan Liu, Yunhuai Liu, Lionel M. Ni, Jianping Fa...
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...