2877 search results - page 395 / 576 » Computational Biology |
171
click to vote
FOCS
2005
IEEE
16 years 3 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
191
click to vote
PAKDD
2004
ACM
15 years 12 months ago
2004
ACM
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
172
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
173
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: High-throughput sequencing technologies, such as the Illumina Genome Analyzer, are powerful new tools for investigating a wide range of biological and medical question...
159
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Many computer vision applications have to cope with large dynamic range and changing illumination conditions in the environment. Any attempt to deal with these conditions at the a...