5100 search results - page 756 / 1020 » The Linear Complexity of a Graph |
192
click to vote
WSCG
2003
15 years 8 months ago
2003
We present a refinement and a coarsening (also simplification or decimation) algorithm for the adaptive representation of bivariate functions. The algorithms have proved to be eff...
186
click to vote
WSC
2000
15 years 7 months ago
2000
Discrete Event Simulation (DES) has been used as a design and validation tool in various production and business applications. DES can also be utilized for analyzing the product-m...
165
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
135
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...