2981 search results - page 239 / 597 » Word Sense and Subjectivity |
172
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
139
click to vote
ORDER
2000
15 years 6 months ago
2000
We prove that, given a nontrivial Boolean algebra B, a compact convex set S and a group G, there is an orthomodular lattice L with the center isomorphic to B, the automorphism grou...
161
click to vote
PE
2000
Springer
15 years 6 months ago
2000
Springer
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
169
click to vote
SIAMAM
2000
15 years 6 months ago
2000
A simplified electrodiffusion model for rectangular current pulses in ionic channels of biological membranes is presented. Numerical simulations and a dynamical systems analysis of...
141
click to vote
SIAMDM
2000
15 years 6 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...