Sciweavers

1578 search results - page 276 / 316
» Algorithmic randomness of continuous functions
Sort
View
BMCBI
2007
143views more  BMCBI 2007»
13 years 8 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
BIOINFORMATICS
2011
13 years 3 months ago
Integrative network alignment reveals large regions of global network similarity in yeast and human
Motivation: High-throughput methods for detecting molecular interactions have produced large sets of biological network data with much more yet to come. Analogous to sequence alig...
Oleksii Kuchaiev, Natasa Przulj
PAMI
2011
13 years 3 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 9 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 3 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...