Sciweavers

1095 search results - page 53 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
PODS
2012
ACM
240views Database» more  PODS 2012»
13 years 4 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
ISPA
2007
Springer
15 years 8 months ago
Channel Assignment and Spatial Reuse Scheduling to Improve Throughput and Enhance Fairness in Wireless Mesh Networks
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignmen...
Nguyen H. Tran, Choong Seon Hong
NOCS
2007
IEEE
15 years 8 months ago
Implementing DSP Algorithms with On-Chip Networks
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
Xiang Wu, Tamer Ragheb, Adnan Aziz, Yehia Massoud
119
Voted
ICDCS
2002
IEEE
15 years 7 months ago
Routing Indices For Peer-to-Peer Systems
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...
Arturo Crespo, Hector Garcia-Molina
131
Voted
GRID
2006
Springer
15 years 2 months ago
Cacheable Decentralized Groups for Grid Resource Access Control
Abstract-- Sharing data among collaborators in widely distributed systems remains a challenge due to limitations with existing methods for defining groups across administrative dom...
Jeffrey Hemmes, Douglas Thain