Sciweavers

333 search results - page 13 / 67
» Computation with Absolutely No Space Overhead
Sort
View
SIPS
2007
IEEE
14 years 4 months ago
Sphere Decoding for Multiprocessor Architectures
Motivated by the need for high throughput sphere decoding for multipleinput-multiple-output (MIMO) communication systems, we propose a parallel depth-first sphere decoding (PDSD)...
Qi Qi, Chaitali Chakrabarti
TON
2008
125views more  TON 2008»
13 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
TPDS
2002
198views more  TPDS 2002»
13 years 9 months ago
Orthogonal Striping and Mirroring in Distributed RAID for I/O-Centric Cluster Computing
This paper presents a new distributed disk-array architecture for achieving high I/O performance in scalable cluster computing. In a serverless cluster of computers, all distribute...
Kai Hwang, Hai Jin, Roy S. C. Ho
RTSS
2008
IEEE
14 years 4 months ago
Perpendicular Intersection: Locating Wireless Sensors with Mobile Beacon
Existing localization approaches are divided into two groups: range-based and range-free. The range-free schemes often suffer from poor accuracy and low scalability, while the ran...
Zhongwen Guo, Ying Guo, Feng Hong, Xiaohui Yang, Y...
ICON
2007
IEEE
14 years 4 months ago
Myth: An Accurate and Scalable Network Coordinate System under High Node Churn Rate
—Network coordinate (NC) system is an efficient mechanism to predict Internet distance (latency) with limited times of measurement. In this paper, we focus on the node churn pro...
Yang Chen, Genyi Zhao, Ang Li, Beixing Deng, Xing ...