Sciweavers

3190 search results - page 517 / 638
» cans 2011
Sort
View
DAC
2011
ACM
14 years 6 months ago
Fault-tolerant 3D clock network
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
Chiao-Ling Lung, Yu-Shih Su, Shih-Hsiu Huang, Yiyu...
DGO
2011
285views Education» more  DGO 2011»
14 years 6 months ago
Social media use by government: from the routine to the critical
Social media (i.e., Twitter, Facebook, Flickr, YouTube) and other services with user-generated content have made a staggering amount of information (and misinformation) available....
Andrea L. Kavanaugh, Edward A. Fox, Steven D. Shee...
ICDCS
2011
IEEE
14 years 6 months ago
Intelligent Placement of Datacenters for Internet Services
—Popular Internet services are hosted by multiple geographically distributed datacenters. The location of the datacenters has a direct impact on the services’ response times, c...
Iñigo Goiri, Kien Le, Jordi Guitart, Jordi ...
ICDCS
2011
IEEE
14 years 6 months ago
Starlink: Runtime Interoperability between Heterogeneous Middleware Protocols
—Interoperability remains a challenging and growing problem within distributed systems. A range of heterogeneous network and middleware protocols which cannot interact with one a...
Yérom-David Bromberg, Paul Grace, Laurent R...
CORR
2012
Springer
228views Education» more  CORR 2012»
14 years 2 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled