Sciweavers

779 search results - page 70 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
15 years 4 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
COCOA
2009
Springer
15 years 7 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
BMCBI
2011
14 years 11 months ago
AnyExpress: Integrated toolkit for analysis of cross-platform gene expression data using a fast interval matching algorithm
Background: Cross-platform analysis of gene express data requires multiple, intricate processes at different layers with various platforms. However, existing tools handle only a s...
Jihoon Kim, Kiltesh Patel, Hyunchul Jung, Winston ...
FOCS
2009
IEEE
15 years 11 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
OWLED
2008
15 years 5 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves