Sciweavers

2814 search results - page 290 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
TON
2008
134views more  TON 2008»
15 years 12 days ago
Efficient broadcasting using network coding
Abstract-- We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Ou...
Christina Fragouli, Jörg Widmer, Jean-Yves Le...
115
Voted
CIKM
2006
Springer
15 years 4 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...
131
Voted
BMCBI
2007
149views more  BMCBI 2007»
15 years 16 days ago
Robust imputation method for missing values in microarray data
Background: When analyzing microarray gene expression data, missing values are often encountered. Most multivariate statistical methods proposed for microarray data analysis canno...
Dankyu Yoon, Eun-Kyung Lee, Taesung Park
ISPA
2005
Springer
15 years 6 months ago
Online Adaptive Fault-Tolerant Routing in 2D Torus
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
Yamin Li, Shietung Peng, Wanming Chu
87
Voted
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 4 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....