Sciweavers

4866 search results - page 785 / 974
» UML for Global Computing
Sort
View
ASPDAC
2006
ACM
95views Hardware» more  ASPDAC 2006»
15 years 10 months ago
The design and implementation of a low-latency on-chip network
— Many of the issues that will be faced by the designers of multi-billion transistor chips may be alleviated by the presence of a flexible global communication infrastructure. I...
Robert D. Mullins, Andrew West, Simon W. Moore
INFOSCALE
2006
ACM
15 years 10 months ago
A generic search strategy for large-scale real-world networks
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kuni...
INFOSCALE
2006
ACM
15 years 10 months ago
PENS: an algorithm for density-based clustering in peer-to-peer systems
Huge amounts of data are available in large-scale networks of autonomous data sources dispersed over a wide area. Data mining is an essential technology for obtaining hidden and v...
Mei Li, Guanling Lee, Wang-Chien Lee, Anand Sivasu...
NPAR
2006
ACM
15 years 10 months ago
X-toon: an extended toon shader
: Some example effects achieved by our extended toon shader: continuous levels of abstraction (a); abstraction of near-silhouette regions: smoothing (b), and opacity (c); backlight...
Pascal Barla, Joëlle Thollot, Lee Markosian
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden