3433 search results - page 407 / 687 » Heuristics for a bidding problem |
185
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
185
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Inferring orthologous and paralogous genes is an important problem in whole genomes comparisons, both for functional or evolutionary studies. In this paper, we introduce a new appr...
187
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
204
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
164
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...