Sciweavers

256 search results - page 17 / 52
» A practical comparison of two K-Means clustering algorithms
Sort
View
TON
2008
109views more  TON 2008»
14 years 11 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta
91
Voted
SAC
2004
ACM
15 years 5 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
ICML
2006
IEEE
16 years 14 days ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
HPDC
2010
IEEE
15 years 23 days ago
Comparison of resource platform selection approaches for scientific workflows
Cloud computing is increasingly considered as an additional computational resource platform for scientific workflows. The cloud offers opportunity to scale-out applications from d...
Yogesh L. Simmhan, Lavanya Ramakrishnan
97
Voted
CORR
2007
Springer
165views Education» more  CORR 2007»
14 years 11 months ago
Comparison of Tree-Child Phylogenetic Networks
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
Gabriel Cardona, Francesc Rosselló, Gabriel...