3096 search results - page 142 / 620 » Theory and Use of the EM Algorithm |
136
click to vote
JACM
2000
15 years 4 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...
123
click to vote
KES
1998
Springer
15 years 9 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
165
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
145
Voted
SRDS
1998
IEEE
15 years 9 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
175
click to vote
ICASSP
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper, the issue of network topology control in wireless networks using a fully distributed algorithm is considered. Whereas the proposed distributed algorithm is designed...