Sciweavers

1541 search results - page 75 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
EUROPAR
2009
Springer
14 years 3 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
ICALP
2004
Springer
14 years 2 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
ICC
2007
IEEE
288views Communications» more  ICC 2007»
14 years 3 months ago
Joint Channel State Based Random Access and Adaptive Modulation in Wireless LAN with Multi-Packet Reception
—Conventional 802.11 medium access control (MAC) characteristics. In particular, all of these designs adopted a protocols have been designed separately from the characteristics s...
Wei Lan Huang, Khaled Ben Letaief, Ying Jun Zhang
VTC
2007
IEEE
105views Communications» more  VTC 2007»
14 years 3 months ago
Random Beamforming OFDMA for Future Generation Cellular Communication Systems
—This paper presents a downlink performance analysis of a Layered Random Beamforming (LRB) - MIMO-OFDMA Physical Layer (PHY) as applicable to future generation wireless communica...
Congzheng Han, Angela Doufexi, Simon Armour, Joe M...
ICML
2008
IEEE
14 years 10 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash