Sciweavers

1414 search results - page 225 / 283
» Randomness and Universal Machines
Sort
View
SAGA
2009
Springer
14 years 4 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
ECML
2004
Springer
14 years 3 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
ISAAC
2003
Springer
85views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Geometric Restrictions on Producible Polygonal Protein Chains
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
BMCBI
2010
183views more  BMCBI 2010»
13 years 10 months ago
Active learning for human protein-protein interaction prediction
Background: Biological processes in cells are carried out by means of protein-protein interactions. Determining whether a pair of proteins interacts by wet-lab experiments is reso...
Thahir P. Mohamed, Jaime G. Carbonell, Madhavi Gan...
BMCBI
2010
190views more  BMCBI 2010»
13 years 10 months ago
Sample size and statistical power considerations in high-dimensionality data settings: a comparative study of classification alg
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
Yu Guo, Armin Graber, Robert N. McBurney, Raji Bal...