21324 search results - page 466 / 4265 » Making the case for computing |
169
click to vote
CIE
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
179
click to vote
ISSAC
2005
Springer
16 years 16 days ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
197
click to vote
WG
2005
Springer
16 years 15 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 ...
196
click to vote
DNA
2004
Springer
16 years 13 days 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...
174
click to vote
IPPS
1997
IEEE
15 years 11 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...