The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Classification is a core task in knowledge discovery and data mining, and there has been substantial research effort in developing sophisticated classification models. In a parall...
Ariel Fuxman, Anitha Kannan, Andrew B. Goldberg, R...
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
Exploratory search, in which a user investigates complex concepts, is cumbersome with today’s search engines. We present a new exploratory search approach that generates interac...
Brent Hecht, Samuel Carton, Mahmood Quaderi, Johan...
Background: BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local ...
Scot E. Dowd, Joaquin Zaragoza, Javier R. Rodrigue...