Sciweavers

2080 search results - page 92 / 416
» Measuring empirical computational complexity
Sort
View
IMC
2003
ACM
15 years 5 months ago
Constructing internet coordinate system based on delay measurement
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
Hyuk Lim, Jennifer C. Hou, Chong-Ho Choi
EGC
2009
Springer
14 years 9 months ago
Discrepancy Analysis of Complex Objects Using Dissimilarities
Abstract. In this article we consider objects for which we have a matrix of dissimilarities and we are interested in their links with covariates. We focus on state sequences for wh...
Matthias Studer, Gilbert Ritschard, Alexis Gabadin...
ICIP
2006
IEEE
15 years 6 months ago
Low-Complexity Rate Control for Efficient H.263 to H.264/AVC Video Transcoding
Rate control is a complicated problem in the H.264/AVC coding standard, extra computation is usually needed for the existing rate control schemes to estimate the complexity of fra...
Chi-Wang Ho, Oscar C. Au, S.-H. Gary Chan, Shu-Kei...
IWCMC
2010
ACM
15 years 5 months ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 3 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky