Sciweavers

443 search results - page 30 / 89
» Analysis of Heuristics for Number Partitioning
Sort
View
IS
2007
13 years 7 months ago
Mining association rules in very large clustered domains
Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
Alexandros Nanopoulos, Apostolos N. Papadopoulos, ...
IPPS
1999
IEEE
13 years 12 months ago
Hiding Communication Latency in Reconfigurable Message-Passing Environments
Communication overhead is one of the most important factors affecting the performance of message passing multicomputers. We present evidence (through the analysis of several paral...
Ahmad Afsahi, Nikitas J. Dimopoulos
IMC
2007
ACM
13 years 9 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
ALMOB
2006
89views more  ALMOB 2006»
13 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
IWANN
2009
Springer
14 years 2 months ago
Self Organized Dynamic Tree Neural Network
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...
Juan Francisco de Paz, Sara Rodríguez, Javi...