Sciweavers

1059 search results - page 54 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
IRI
2005
IEEE
15 years 3 months ago
Handling missing values via decomposition of the conditioned set
In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly impr...
Mei-Ling Shyu, Indika Kuruppu-Appuhamilage, Shu-Ch...
MOC
2002
92views more  MOC 2002»
14 years 9 months ago
Asymptotic properties of the spectral test, diaphony, and related quantities
This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The re...
Hannes Leeb
TCOM
2008
98views more  TCOM 2008»
14 years 9 months ago
Performance evaluation of multi-hop CSMA/CA networks in fading environments
The performance of multi-hop CSMA/CA networks has in most cases been evaluated via simulations, or analytically using a perfect collision channel model. Using such methods, one ca...
Duong A. Hoang, Ronald A. Iltis
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 10 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
WOSP
2005
ACM
15 years 3 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills