Sciweavers

1132 search results - page 93 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ICASSP
2008
IEEE
16 years 26 days ago
Source coding with intermittent and degraded side information at the decoder
Practical schemes for distributed video coding with side information at the decoder need to consider non-standard correlation models in order to take non-stationarities into accou...
Francesca Bassi, Michel Kieffer, Claudio Weidmann
ACSC
2005
IEEE
16 years 1 days ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Mihalis Beis, William Duckworth, Michele Zito
GECCO
2004
Springer
15 years 11 months ago
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
Andreas Alexander Albrecht
EJC
2008
15 years 6 months ago
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces
We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improv...
Jan De Beule, Andreas Klein, Klaus Metsch, Leo Sto...
JPDC
2006
104views more  JPDC 2006»
15 years 6 months ago
Performance analysis of different checkpointing and recovery schemes using stochastic model
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...
Partha Sarathi Mandal, Krishnendu Mukhopadhyaya