6142 search results - page 1014 / 1229 » The Complexity of Partition Functions |
134
click to vote
ALMOB
2006
15 years 5 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
156
click to vote
AO
2006
15 years 5 months ago
2006
Large software systems are modularized in order to improve manageability. The parts of the software system communicate in order to achieve the desired functionality. To better und...
127
click to vote
FGCS
2008
15 years 5 months ago
2008
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
138
click to vote
FOCM
2008
15 years 5 months ago
2008
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...
140
click to vote
FTML
2008
15 years 5 months ago
2008
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...