18306 search results - page 2989 / 3662 » Algorithmics in Exponential Time |
175
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
336
click to vote
AICCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
168
Voted
BMCBI
2010
15 years 6 months ago
2010
Background: Affymetrix GeneChip microarrays are popular platforms for expression profiling in two types of studies: detection of differential expression computed by p-values of t-...
201
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
188
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...