Sciweavers

1458 search results - page 29 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
COCOA
2008
Springer
13 years 10 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
IJISTA
2008
95views more  IJISTA 2008»
13 years 8 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Personalized Data Set for Analysis
Data Management portfolio within an organization has seen an upsurge in initiatives for compliance, security, repurposing and storage within and outside the organization. When suc...
Vishal Gupta, Ashutosh Saxena
BMCBI
2008
126views more  BMCBI 2008»
13 years 8 months ago
Relating gene expression data on two-component systems to functional annotations in Escherichia coli
Background: Obtaining physiological insights from microarray experiments requires computational techniques that relate gene expression data to functional information. Traditionall...
Anne M. Denton, Jianfei Wu, Megan K. Townsend, Pre...
ICML
2007
IEEE
14 years 9 months ago
Maximum margin clustering made practical
Maximum margin clustering (MMC) is a recent large margin unsupervised learning approach that has often outperformed conventional clustering methods. Computationally, it involves n...
Kai Zhang, Ivor W. Tsang, James T. Kwok