2745 search results - page 204 / 549 » A fast algorithm for computing large Fibonacci numbers |
112
click to vote
TIT
2002
15 years 4 months ago
2002
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
139
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
140
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
137
click to vote
PARELEC
2006
IEEE
15 years 10 months ago
2006
IEEE
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...
141
click to vote
WCRE
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we describe interprocedural static single assignment form (ISSA) with optimizations as implemented in the Bauhaus project. We explain our framework which abstract pr...