16430 search results - page 223 / 3286 » On Computable Tree Functions |
122
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
136
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
149
click to vote
RTA
2000
Springer
15 years 7 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
141
click to vote
IPPS
1995
IEEE
15 years 7 months ago
1995
IEEE
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
120
click to vote
COLING
2010
14 years 11 months ago
2010
It has been known that a combination of multiple kernels and addition of various resources are the best options for improving effectiveness of kernel-based PPI extraction methods....