147 search results - page 24 / 30 » How an optimal observer can collapse the search space |
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
Proteins are involved either directly or indirectly in all biological processes in living organisms. It is now widely accepted that conformational changes of proteins can critical...
ANOR
2011
13 years 2 months ago
2011
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
CVPR
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose a new method to partition an unlabeled dataset, called Discriminative Context Partitioning (DCP). It is motivated by the idea of splitting the dataset based only on how...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...