Sciweavers

4781 search results - page 365 / 957
» Online algorithms for network design
Sort
View
GRC
2008
IEEE
15 years 8 months ago
Towards Real-time Performance of Data Value Hiding for Frequent Data Updates
Hiding data values in privacy-preserving data mining (PPDM) protects information against unauthorized attacks while maintaining analytical data properties. The most popular models...
Jie Wang, Justin Zhan, Jun Zhang
DAC
2006
ACM
16 years 25 days ago
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
Ming Li, Qing-An Zeng, Wen-Ben Jone
GLOBECOM
2007
IEEE
16 years 1 months ago
PMTA: Potential-Based Multicast Tree Algorithm with Connectivity Restricted Hosts
— A large number of overlay protocols have been developed, almost all of which assume each host has two-way communication capability. However, this does not hold as the deploymen...
Xiaohui Shi, Yang Chen, Guohan Lu, Beixing Deng, X...
ICAC
2006
IEEE
16 years 28 days ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
15 years 8 months ago
Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
U. Kang, Charalampos E. Tsourakakis, Ana Paula App...