7106 search results - page 348 / 1422 » Restricted Complexity, General Complexity |
190
Voted
RECOMB
2010
Springer
15 years 3 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
141
Voted
WG
2010
Springer
15 years 3 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
121
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
130
click to vote
NAACL
2010
15 years 2 months ago
2010
With the increase in popularity of online review sites comes a corresponding need for tools capable of extracting the information most important to the user from the plain text da...
110
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...