Sciweavers

2504 search results - page 265 / 501
» Methods for comparing rankings of search engine results
Sort
View
ICSM
2005
IEEE
15 years 7 months ago
Dynamic Feature Traces: Finding Features in Unfamiliar Code
This paper introduces an automated technique for feature location: helping developers map features to relevant source code. Like several other automated feature location technique...
Andrew David Eisenberg, Kris De Volder
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 8 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
147
Voted
BMCBI
2008
208views more  BMCBI 2008»
15 years 2 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
CIKM
2008
Springer
15 years 3 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
PAA
2007
15 years 1 months ago
Pairwise feature evaluation for constructing reduced representations
Feature selection methods are often used to determine a small set of informative features that guarantee good classification results. Such procedures usually consist of two compon...
Artsiom Harol, Carmen Lai, Elzbieta Pekalska, Robe...