Sciweavers

1010 search results - page 24 / 202
» Computational Differences between Asymmetrical and Symmetric...
Sort
View
114
Voted
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
15 years 1 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ACSC
2005
IEEE
15 years 5 months ago
Simulating Network Robustness for Critical Infrastructure Networks
We examine the robustness of critical infrastructure networks in the face of terrorist attack, using a simulation experiment that incorporates link capacity; and an extension of d...
Anthony H. Dekker
95
Voted
AIED
2005
Springer
15 years 5 months ago
Tradeoff analysis between knowledge assessment approaches
Abstract: The problem of modeling and assessing an individual’s ability level is central to learning environments. Numerous approaches exists to this end. Computer Adaptive Testi...
Michel Desmarais, Shunkai Fu, Xiaoming Pu
97
Voted
IWCMC
2010
ACM
15 years 4 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
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 3 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman