Sciweavers

8917 search results - page 1771 / 1784
» Abstraction in Algorithm Animation
Sort
View
MASS
2010
173views Communications» more  MASS 2010»
13 years 7 months ago
Efficient routing in delay tolerant networks with correlated node mobility
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szyman...
MICRO
2010
IEEE
270views Hardware» more  MICRO 2010»
13 years 7 months ago
Many-Thread Aware Prefetching Mechanisms for GPGPU Applications
Abstract-- We consider the problem of how to improve memory latency tolerance in massively multithreaded GPGPUs when the thread-level parallelism of an application is not sufficien...
Jaekyu Lee, Nagesh B. Lakshminarayana, Hyesoon Kim...
NOCS
2010
IEEE
13 years 7 months ago
Asynchronous Bypass Channels: Improving Performance for Multi-synchronous NoCs
Abstract--Networks-on-Chip (NoC) have emerged as a replacement for traditional shared-bus designs for on-chip communications. As with all current VLSI designs, however, reducing po...
Tushar N. K. Jain, Paul V. Gratz, Alexander Sprint...
PAISI
2010
Springer
13 years 7 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
PIMRC
2010
IEEE
13 years 7 months ago
Contact surround in opportunistic networks
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
Nadjet Belblidia, Marcelo Dias de Amorim, Jeremie ...
« Prev « First page 1771 / 1784 Last » Next »