4013 search results - page 394 / 803 » computing 2002 |
188
click to vote
EJC
2002
15 years 6 months ago
2002
Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in ...
168
click to vote
FGCS
2002
15 years 6 months ago
2002
Parameter-space studies involve running a single application several times with different parameter sets. Since the jobs are mutually independent, many computing resources can be r...
141
click to vote
FUIN
2002
15 years 6 months ago
2002
One-way and two-way cellular language acceptors with restricted nondeterminism are investigated. The number of nondeterministic state transitions is regarded as limited resource wh...
236
click to vote
IDA
2002
Springer
15 years 6 months ago
2002
Springer
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
158
click to vote
IJCGA
2002
15 years 6 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...