Sciweavers

1185 search results - page 52 / 237
» The Equivalence of Sampling and Searching
Sort
View
UAI
2001
13 years 9 months ago
Improved learning of Bayesian networks
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
Tomás Kocka, Robert Castelo
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
14 years 1 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
BMCBI
2010
140views more  BMCBI 2010»
13 years 5 months ago
An improved machine learning protocol for the identification of correct Sequest search results
Background: Mass spectrometry has become a standard method by which the proteomic profile of cell or tissue samples is characterized. To fully take advantage of tandem mass spectr...
Morten Kallberg, Hui Lu
PR
2007
100views more  PR 2007»
13 years 7 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
DATE
2008
IEEE
121views Hardware» more  DATE 2008»
14 years 2 months ago
On Automated Trigger Event Generation in Post-Silicon Validation
When searching for functional bugs in silicon, debug data is acquired after a trigger event occurs. A trigger event can be configured at run-time using a set of control registers...
Ho Fai Ko, Nicola Nicolici