2446 search results - page 255 / 490 » Choiceless Polynomial Time |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model o...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
RECOMB
2008
Springer
14 years 8 months ago
2008
Springer
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...