552 search results - page 7 / 111 » Lower bounds for dynamic connectivity |
135
click to vote
UMC
2000
15 years 1 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
NIPS
2008
14 years 11 months ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
DAM
2006
14 years 9 months ago
2006
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
PAKDD
2009
ACM
15 years 2 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
COCO
2010
Springer
14 years 11 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...