On the Complexity of the Realisability Problem for Visit Events in Trajectory Sample Databases.

Arthur Jansen, Bart Kuijpers

Browse the full TIME paper archive.