10608 search results - page 356 / 2122 » Complexity of O'Hara's Algorithm |
117
click to vote
ICML
2004
IEEE
15 years 6 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
102
Voted
CIS
2004
Springer
15 years 6 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
93
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
MICAI
2004
Springer
15 years 6 months ago
2004
Springer
We present an optimization algorithm that combines active learning and locally-weighted regression to find extreme points of noisy and complex functions. We apply our algorithm to...
100
click to vote
PRICAI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...