The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Finding discords in time series database is an important problem in a great variety of applications, such as space shuttle telemetry, mechanical industry, biomedicine, and financ...
Yingyi Bu, Oscar Tat-Wing Leung, Ada Wai-Chee Fu, ...
The accurate computational prediction of RNA secondary structures is a difficult task, but an important one, since RNA structure is usually more evolutionarily conserved than prima...
This paper describes the participation of DAEDALUS team at the WebPS-3 Task 1, regarding Web People Search. The focus of our research is to evaluate and compare the computational r...
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...