Sciweavers

221 search results - page 9 / 45
» An Improved Approximation Algorithm for the Column Subset Se...
Sort
View
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
13 years 8 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
COMGEO
2010
ACM
13 years 7 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 3 days ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia
ICTAI
1992
IEEE
13 years 11 months ago
Genetic Algorithms as a Tool for Feature Selection in Machine Learning
This paper describes an approach being explored to improve the usefulness of machine learning techniques for generating classification rules for complex, real world data. The appr...
Haleh Vafaie, Kenneth A. De Jong
BMCBI
2008
139views more  BMCBI 2008»
13 years 7 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg