Sciweavers

963 search results - page 21 / 193
» Escape Analysis on Lists
Sort
View
AAAI
2004
14 years 11 months ago
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Monaldo Mastrolilli, Luca Maria Gambardella
JMLR
2010
136views more  JMLR 2010»
14 years 4 months ago
Evaluation Method for Feature Rankings and their Aggregations for Biomarker Discovery
In this paper we investigate the problem of evaluating ranked lists of biomarkers, which are typically an output of the analysis of high-throughput data. This can be a list of pro...
Ivica Slavkov, Bernard Zenko, Saso Dzeroski
ICDE
2012
IEEE
212views Database» more  ICDE 2012»
13 years 8 days ago
Attribute-Based Subsequence Matching and Mining
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
Yu Peng, Raymond Chi-Wing Wong, Liangliang Ye, Phi...
BMCBI
2005
154views more  BMCBI 2005»
14 years 9 months ago
GObar: A Gene Ontology based analysis and visualization tool for gene sets
Background: Microarray experiments, as well as other genomic analyses, often result in large gene sets containing up to several hundred genes. The biological significance of such ...
Jason S. M. Lee, Gurpreet Katari, Ravi Sachidanand...
IWPC
2007
IEEE
15 years 4 months ago
Combining Formal Concept Analysis with Information Retrieval for Concept Location in Source Code
The paper addresses the problem of concept location in source code by presenting an approach which combines Formal Concept Analysis (FCA) and Latent Semantic Indexing (LSI). In th...
Denys Poshyvanyk, Andrian Marcus