Sciweavers

65 search results - page 13 / 13
» On the number of combinations without certain separations
Sort
View
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 5 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
OTM
2009
Springer
13 years 11 months ago
A Component Assignment Framework for Improved Capacity and Assured Performance in Web Portals
Abstract. Web portals hosting large-scale internet applications have become popular due to the variety of services they provide to their users. These portals are developed using co...
Nilabja Roy, Yuan Xue, Aniruddha S. Gokhale, Larry...
CCR
2005
97views more  CCR 2005»
13 years 4 months ago
On the robustness of router-based denial-of-service (DoS) defense systems
This paper focuses on "router-based" defense mechanisms, and whether they can provide effective solutions to network Denialof-Service (DoS) attacks. Router-based defense...
Ying Xu, Roch Guérin
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
13 years 9 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
EUROSYS
2007
ACM
14 years 1 months ago
hFS: a hybrid file system prototype for improving small file and metadata performance
Two oft-cited file systems, the Fast File System (FFS) and the Log-Structured File System (LFS), adopt two sharply different update strategies—update-in-place and update-out-of-...
Zhihui Zhang, Kanad Ghose