1243 search results - page 15 / 249 » On the locality of bounded growth |
IPL
2010
13 years 2 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
TSP
2011
13 years 2 months ago
2011
—Modern passive emitter-location systems are often based on joint estimation of the time-difference of arrival (TDOA) and frequency-difference of arrival (FDOA) of an unknown sig...
ECCC
2011
13 years 2 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
AAAI
2008
13 years 10 months ago
2008
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
CCCG
2010
13 years 9 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...