Sciweavers

620 search results - page 112 / 124
» Optimizing the BSD routing system for parallel processing
Sort
View
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
14 years 7 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
ICASSP
2009
IEEE
13 years 11 months ago
What happens when cognitive terminals compete for a relaying node?
We introduce a new channel, which consists of an interference channel (IC) in parallel with an interference relay channel (IRC), to analyze the interaction between two selfish and...
Elena Veronica Belmega, Brice Djeumou, Samson Lasa...
TCSV
2002
124views more  TCSV 2002»
13 years 7 months ago
Efficient moving object segmentation algorithm using background registration technique
An efficient moving object segmentation algorithm suitable for real-time content-based multimedia communication systems is proposed in this paper. First, a background registration ...
Shao-Yi Chien, Shyh-Yih Ma, Liang-Gee Chen
ICDCS
2007
IEEE
14 years 1 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
ISPASS
2009
IEEE
14 years 2 months ago
GARNET: A detailed on-chip network model inside a full-system simulator
Until very recently, microprocessor designs were computation-centric. On-chip communication was frequently ignored. This was because of fast, single-cycle on-chip communication. T...
Niket Agarwal, Tushar Krishna, Li-Shiuan Peh, Nira...