Sciweavers

39 search results - page 7 / 8
» Total Path Length For Random Recursive Trees
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
14 years 11 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
15 years 6 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,...
ICCAD
2003
IEEE
123views Hardware» more  ICCAD 2003»
15 years 8 months ago
The Y-Architecture for On-Chip Interconnect: Analysis and Methodology
The Y-architecture for on-chip interconnect is based on pervasive use of 0-, 120-, and 240-degree oriented semi-global and global wiring. Its use of three uniform directions explo...
Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Io...
TCSV
2008
150views more  TCSV 2008»
14 years 11 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo