4860 search results - page 699 / 972 » SNPs Problems, Complexity, and Algorithms |
180
click to vote
PC
2000
15 years 6 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
162
click to vote
TNN
1998
15 years 6 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
175
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The two observations that 1) many XML documents are stored in a database or generated from data stored in a database and 2) processing these documents with XSL stylesheet processo...
218
click to vote
RECOMB
2010
Springer
15 years 5 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...
198
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...