Sciweavers

1964 search results - page 101 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
AAAI
2008
13 years 10 months ago
From Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
Zhiwu Lu, Yuxin Peng, Jianguo Xiao
APSEC
2005
IEEE
14 years 1 months ago
Metrics for Analyzing Module Interactions in Large Software Systems
We present a new set of metrics for analyzing the interaction between the modules of a large software system. We believe that these metrics will be important to any automatic or s...
Santonu Sarkar, Avinash C. Kak, N. S. Nagaraja
VLDB
2007
ACM
149views Database» more  VLDB 2007»
14 years 2 months ago
Probabilistic Skylines on Uncertain Data
Uncertain data are inherent in some important applications. Although a considerable amount of research has been dedicated to modeling uncertain data and answering some types of qu...
Jian Pei, Bin Jiang, Xuemin Lin, Yidong Yuan
BCB
2010
161views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
TRANSCI
2011
80views more  TRANSCI 2011»
13 years 2 months ago
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Ivan Contreras, Jean-François Cordeau, Gilb...