Sciweavers

355 search results - page 62 / 71
» On Central Spanning Trees of a Graph
Sort
View
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 22 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
TON
2008
126views more  TON 2008»
13 years 7 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
14 years 2 months ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...
CVPR
2011
IEEE
13 years 2 months ago
Random Field Topic Model for Semantic Region Analysis in Crowded Scenes from Tracklets
In this paper, a Random Field Topic (RFT) model is proposed for semantic region analysis from motions of objects in crowded scenes. Different from existing approaches of learning ...
Bolei Zhou, Xiaogang Wang
INFOCOM
2007
IEEE
14 years 1 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...