INFOVIS
2003
IEEE
14 years 3 months ago
2003
IEEE
In visualising multidimensional data, it is well known that different types of data require different types of algorithms to process them. Data sets might be distinguished accordi...
INFOVIS
2003
IEEE
14 years 3 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...
ICDM
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract. We present a new distributed association rule mining (D-ARM) algorithm that demonstrates superlinear speed-up with the number of computing nodes. The algorithm is the fi...
ICDM
2003
IEEE
14 years 3 months ago
2003
IEEE
We propose two algorithms for grouping and summarizing association rules. The first algorithm recursively groups rules according to the structure of the rules and generates a tre...
WEBI
2004
Springer
14 years 3 months ago
2004
Springer
Most of the current algorithms for finding related pages are exclusively based on text corpora of the WWW or incorporate only authority or hub values of pages. In this paper, we ...
WEA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
WEA
2004
Springer
14 years 3 months ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
WEA
2004
Springer
14 years 3 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
WEA
2004
Springer
14 years 3 months ago
2004
Springer
