Sciweavers

2924 search results - page 211 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
1997
IEEE
15 years 11 months ago
Distributed Submesh Determination in Faulty Tori and Meshes
Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance d...
Hsing-Lung Chen, Shu-Hua Hu
IWCMC
2009
ACM
16 years 1 months ago
Multiple-antenna multiple-relay system with precoding for multiuser transmission
Multi-hop relaying will play a central role in next generation wireless systems. In this paper a novel relaying strategy that uses multiple-input multiple-output (MIMO) relays in ...
Arash Talebi, Witold A. Krzymien
BROADNETS
2005
IEEE
16 years 13 days ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
ICASSP
2011
IEEE
14 years 10 months ago
A robust clock synchronization algorithm for wireless sensor networks
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
Jang-Sub Kim, Jaehan Lee, Erchin Serpedin, Khalid ...
214
Voted
ICDCS
2000
IEEE
15 years 11 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...