Sciweavers

359 search results - page 66 / 72
» A Hybrid Genetic Algorithm for the Quadratic Assignment Prob...
Sort
View
TSMC
2008
102views more  TSMC 2008»
13 years 8 months ago
Context-Dependent DNA Coding With Redundancy and Introns
Abstract--Deoxyribonucleic acid (DNA) coding methods determine the meaning of a certain character in individual chromosomes by the characters surrounding it. The meaning of each ch...
Peng Xiao, Prahlad Vadakkepat, Tong Heng Lee
NIPS
2003
13 years 10 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
ML
2008
ACM
101views Machine Learning» more  ML 2008»
13 years 8 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci