2960 search results - page 450 / 592 » Learning from Multiple Sources |
191
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
125
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: In metagenomic studies, a process called binning is necessary to assign contigs that belong to multiple species to their respective phylogenetic groups. Most of the cu...
156
click to vote
CIVR
2007
Springer
15 years 9 months ago
2007
Springer
Among the various types of semantic concepts modeled, events pose the greatest challenge in terms of computational power needed to represent the event and accuracy that can be ach...
206
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
127
click to vote
CIDM
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...