In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
Hwanjo Yu, Taehoon Kim, Jinoh Oh, Ilhwan Ko, Sungc...
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
Background: Single nucleotide polymorphisms (SNP) constitute more than 90% of the genetic variation, and hence can account for most trait differences among individuals in a given ...
Lakshmi K. Matukumalli, John J. Grefenstette, Davi...