5183 search results - page 292 / 1037 » The Complexity of Distributions |
131
click to vote
ECAL
2003
Springer
15 years 12 months ago
2003
Springer
Building large complex minds is difficult because we do not understand what the necessary components are or how they should interact. Even if the components were known it is diffic...
162
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
204
click to vote
WCC
2005
Springer
16 years 3 days ago
2005
Springer
Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period qn − 1 are investigated under linear operations on sequences. We prove that all members o...
185
click to vote
WDAG
2004
Springer
15 years 12 months ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
138
click to vote
INFORMATICALT
2000
15 years 6 months ago
2000
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...