Moving toward 4G, wireless ad hoc networks receive growing interest due to users’ provisioning of mobility, usability of services, and seamless communications. In ad hoc network...
Qian Zhang, Qing Chen, Fan Yang, Xuemin Shen, Zhis...
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...
We demonstrate a method for collaborative ranking of future events. Previous work on recommender systems typically relies on feedback on a particular item, such as a movie, and ge...
Einat Minkov, Ben Charrow, Jonathan Ledlie, Seth J...
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
Roman van der Krogt, Jacob Feldman, James Little, ...
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...