Sciweavers

1104 search results - page 107 / 221
» Experimental evaluation of optimal CSMA
Sort
View
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
14 years 2 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
CINQ
2004
Springer
133views Database» more  CINQ 2004»
14 years 2 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
COCOON
2006
Springer
14 years 2 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
PODS
2000
ACM
120views Database» more  PODS 2000»
14 years 1 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...
WSC
2008
14 years 17 days ago
Comparing designs for computer simulation experiments
The use of simulation as a modeling and analysis tool is wide spread. Simulation is an enabling tool for experimenting virtually on a validated computer environment. Often the und...
Rachel T. Johnson, Bradley Jones, John W. Fowler, ...