Sciweavers

736 search results - page 111 / 148
» Approximating the Number of Network Motifs
Sort
View
MICRO
2008
IEEE
116views Hardware» more  MICRO 2008»
15 years 4 months ago
Power reduction of CMP communication networks via RF-interconnects
As chip multiprocessors scale to a greater number of processing cores, on-chip interconnection networks will experience dramatic increases in both bandwidth demand and power dissi...
M.-C. Frank Chang, Jason Cong, Adam Kaplan, Chunyu...
ICNP
2007
IEEE
15 years 4 months ago
A Probabilistic Coverage Protocol for Wireless Sensor Networks
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
Mohamed Hefeeda, Hossein Ahmadi
INFOCOM
2002
IEEE
15 years 2 months ago
Provisioning Content Distribution Networks for Streaming Media
This paper develops simple cost models for provisioning content distribution networks that use the simple and highly scalable bandwidth skimming protocol for streaming. New insight...
Jussara M. Almeida, Derek L. Eager, Michael C. Fer...
INFOCOM
2005
IEEE
15 years 3 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
COMCOM
2008
127views more  COMCOM 2008»
14 years 10 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...