2192 search results - page 114 / 439 » Algorithms for Challenging Motif Problems |
DA
2010
13 years 5 months ago
2010
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
AAAI
2011
12 years 8 months ago
2011
Consider the problem of protecting endangered species by selecting patches of land to be used for conservation purposes. Typically, the availability of patches changes over time, ...
CADE
2012
Springer
11 years 10 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
BIS
2008
13 years 9 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
The front end of many motion analysis algorithms is usually a process that generates bounding boxes around each moving object, roughly segmenting the objects from the background. ...