Sciweavers

5658 search results - page 782 / 1132
» An Efficient Counting Network
Sort
View
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
16 years 3 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
HPCA
2009
IEEE
16 years 1 months ago
MRR: Enabling fully adaptive multicast routing for CMP interconnection networks
On-network hardware support for multi-destination traffic is a desirable feature in most multiprocessor machines. Multicast hardware capabilities enable much more effective bandwi...
Pablo Abad Fidalgo, Valentin Puente, José-&...
BROADNETS
2007
IEEE
16 years 1 months ago
On supporting high quality 3D geometry multicasting over IEEE 802.11 wireless networks
—With significant improvements in both wireless technologies and computational capabilities of mobile devices, it is now possible to exchange and render 3D graphics over wireless...
Hui Li, Ming Li, B. Prabhakaran
ICON
2007
IEEE
16 years 1 months ago
TEAM: Trust Enhanced Security Architecture for Mobile Ad-hoc Networks
— Security is paramount in Mobile Ad-hoc Networks (MANET) as they are not conducive to centralized trusted authorities. Several solutions have been proposed MANET in the areas of...
Venkatesan Balakrishnan, Vijay Varadharajan, Udaya...
GLOBECOM
2006
IEEE
16 years 25 days ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang