4103 search results - page 716 / 821 » Some results on the Collatz problem |
170
click to vote
JAL
2006
15 years 6 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
171
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
155
click to vote
JISE
2007
15 years 6 months ago
2007
Query expansion is extensively applied in information retrieval systems, such as search engines. Most conventional approaches to query expansion have been developed based on textua...
157
click to vote
CCE
2004
15 years 6 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
244
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...