Sciweavers

96 search results - page 11 / 20
» Clustering event logs using iterative partitioning
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
ICPADS
2005
IEEE
14 years 1 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
STACS
2007
Springer
14 years 2 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
AUIC
2002
IEEE
14 years 25 days ago
In Support of User Interface Design in the Rational Unified Process
The Rational Unified Process (RUP) is a use case driven iterative software engineering process User Interface design within the RUP involves user interface modelling and user inte...
Chris Phillips, Elizabeth A. Kemp
OSDI
2008
ACM
14 years 8 months ago
Predicting Computer System Failures Using Support Vector Machines
Mitigating the impact of computer failure is possible if accurate failure predictions are provided. Resources, applications, and services can be scheduled around predicted failure...
Errin W. Fulp, Glenn A. Fink, Jereme N. Haack