We present a large-system performance analysis of blind and group-blind multiuser detection methods. In these methods, the receivers are estimated based on the received signal samp...
Abstract-We describe Localization-Space Trails (LOST), a method that enables a team of robots to navigate between places of interest in an initially unknown environment using a tra...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
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— For many tasks in populated environments, robots need to keep track of present and future motion states of people. Most approaches to people tracking make weak assumpti...
Matthias Luber, Johannes Andreas Stork, Gian Diego...