2745 search results - page 268 / 549 » A fast algorithm for computing large Fibonacci numbers |
143
click to vote
PAM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
164
click to vote
PIMRC
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
132
click to vote
ISSAC
2004
Springer
15 years 10 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
126
click to vote
ICANN
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
145
click to vote
VISSYM
2003
15 years 6 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...