9997 search results - page 272 / 2000 » The case for crowd computing |
182
click to vote
WG
2005
Springer
16 years 2 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
189
click to vote
DNA
2004
Springer
16 years 5 hour ago
2004
Springer
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
164
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
191
click to vote
VISUALIZATION
1993
IEEE
15 years 10 months ago
1993
IEEE
Visualization has proved an e ective tool in the understanding of large data sets in computational science and engineering. There is growing interest today in the development of p...
136
click to vote
PARA
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...