Sciweavers

2497 search results - page 224 / 500
» Requirements for models of achievable routing
Sort
View
CIC
2004
15 years 8 months ago
Dynamic Characteristics of k-ary n-cube Networks for Real-time Communication
Overlay topologies are now popular with many emerging peer-to-peer (P2P) systems, to efficiently locate and retrieve information. In contrast, the focus of this work is to use ove...
Gerald Fry, Richard West
FSTTCS
2004
Springer
16 years 7 hour ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICPR
2002
IEEE
16 years 7 months ago
On Selecting Colour Components for Skin Detection
We used a data analysis approach for selecting colour components for skin detection. The criterion for this selection was to achieve a reasonable degree of generalisation and reco...
Giovani Gómez
IEEEPACT
2002
IEEE
15 years 11 months ago
Efficient Interconnects for Clustered Microarchitectures
Clustering is an effective microarchitectural technique for reducing the impact of wire delays, the complexity, and the power requirements of microprocessors. In this work, we inv...
Joan-Manuel Parcerisa, Julio Sahuquillo, Antonio G...
FCCM
2000
IEEE
133views VLSI» more  FCCM 2000»
15 years 11 months ago
Configuration Caching Management Techniques for Reconfigurable Computing
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...
Zhiyuan Li, Katherine Compton, Scott Hauck