Sciweavers

1941 search results - page 359 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
WWW
2008
ACM
15 years 10 months ago
Tag-based social interest discovery
The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research...
Xin Li, Lei Guo, Yihong Eric Zhao
SAC
2010
ACM
15 years 4 months ago
T2D: a peer to peer trust management system based on disposition to trust
While the trust paradigm is essential to broadly extend the communication between the environment’s actors, the evaluation of trust becomes a challenge when confronted with init...
Rachid Saadi, Jean-Marc Pierson, Lionel Brunie
STACS
2010
Springer
15 years 4 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
DAC
2005
ACM
15 years 10 months ago
Fault and energy-aware communication mapping with guaranteed latency for applications implemented on NoC
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
SIGCOMM
2003
ACM
15 years 3 months ago
Scaling internet routers using optics
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in practice) do not provide the throughput guarantees that network operators need to ma...
Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, Da...