Sciweavers

3275 search results - page 619 / 655
» Issues in Communication Game
Sort
View
GLOBECOM
2006
IEEE
15 years 10 months 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
GLOBECOM
2006
IEEE
15 years 10 months ago
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in Wireless Sensor Networks
— Coverage is an important issue related to WSN quality of service. Several centralized/decentralized solutions based on the geometry information of sensors and under the assumpt...
Azzedine Boukerche, Xin Fei, Regina Borges de Arau...
ICMCS
2006
IEEE
179views Multimedia» more  ICMCS 2006»
15 years 10 months ago
Optimizing Algorithms for Region-of-Interest Video Compression, with Application to Mobile Telehealth
Wireless communication of video poses constraints on information capacity. Region-of-Interest (ROI) video coding provides higher quality in the ROI, but poorer quality in the back...
Sira Rao, Nikil Jayant
ICPP
2006
IEEE
15 years 10 months ago
Using Gossip for Dynamic Resource Discovery
— Resource discovery is the process of locating shared resources on a computer network. Previously studied examples include efficiently finding files with a given title on a ...
Eric Simonton, Byung Kyu Choi, Steven Seidel
IPCCC
2006
IEEE
15 years 10 months ago
OS-aware tuning: improving instruction cache energy efficiency on system workloads
Low power has been considered as an important issue in instruction cache (I-cache) designs. Several studies have shown that the I-cache can be tuned to reduce power. These techniq...
Tao Li, Lizy K. John