Sciweavers

9209 search results - page 428 / 1842
» Data Space Randomization
Sort
View
NIPS
2004
15 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
BMCBI
2006
142views more  BMCBI 2006»
15 years 6 months ago
Correlated fragile site expression allows the identification of candidate fragile genes involved in immunity and associated with
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
Angela Re, Davide Corà, Alda Maria Puliti, ...
BMCBI
2007
202views more  BMCBI 2007»
15 years 6 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
ML
2008
ACM
248views Machine Learning» more  ML 2008»
15 years 6 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
IS
2010
15 years 5 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley