Sciweavers

50 search results - page 2 / 10
» Definable encodings in the computably enumerable sets
Sort
View
IPPS
2002
IEEE
13 years 11 months ago
Parallel Out-of-Core Algorithm for Genome-Scale Enumeration of Metabolic Systemic Pathways
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...
Nagiza F. Samatova, Al Geist, George Ostrouchov, A...
DCC
2010
IEEE
14 years 1 months ago
Lossless Data Compression via Substring Enumeration
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
Danny Dubé, Vincent Beaudoin
ISMB
1993
13 years 8 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
DM
2002
82views more  DM 2002»
13 years 6 months ago
Hilbert functions of ladder determinantal varieties
We outline the computation of an explicit formula for the Hilbert function of the ladder determinantal varieties defined by the vanishing of all minors of a fixed size of a rectang...
Sudhir R. Ghorpade
TCS
2008
13 years 6 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan