Sciweavers

16404 search results - page 936 / 3281
» A set coverage problem
Sort
View
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 11 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
FLAIRS
2007
15 years 10 months ago
Naive Bayes and Decision Trees for Function Tagging
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree....
Mihai C. Lintean, Vasile Rus
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
15 years 9 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
CEC
2008
IEEE
15 years 9 months ago
Automated solution selection in multi-objective optimisation
This paper proposes an approach to the solution of multi-objective optimisation problems that delivers a single, preferred solution. A conventional, population-based, multiobjectiv...
Andrew Lewis, David Ireland
COCOON
2008
Springer
15 years 9 months ago
Optimal Insertion of a Segment Highway in a City Metric
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
Matias Korman, Takeshi Tokuyama