Sciweavers

350 search results - page 16 / 70
» Lower and upper bounds on obtaining history independence
Sort
View
DAGSTUHL
2008
15 years 1 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
INFOCOM
2010
IEEE
14 years 10 months ago
Queuing Analysis in Multichannel Cognitive Spectrum Access: A Large Deviation Approach
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each prima...
Amine Laourine, Shiyao Chen, Lang Tong
RECOMB
2006
Springer
16 years 2 days ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...
86
Voted
ISIPTA
2003
IEEE
130views Mathematics» more  ISIPTA 2003»
15 years 5 months ago
Some Results on Generalized Coherence of Conditional Probability Bounds
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 6 months ago
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
Stefan Kiefer, Andrzej S. Murawski, Joël Ouak...