6358 search results - page 361 / 1272 » Computing spectral sequences |
167
click to vote
IPPS
2006
IEEE
16 years 24 days ago
2006
IEEE
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
177
click to vote
SC
2005
ACM
16 years 10 days ago
2005
ACM
Users often behave speculatively, submitting work that initially they do not know is needed. Farm computing often consists of single node speculative tasks issued by, e.g., bioinf...
140
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Image registration between multi-sensor imagery is a challenging problem due to the difficulties associated with finding a correspondence between pixels from images taken by the...
227
click to vote
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
197
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...