Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,002
D²-Tree: A New Overlay with Deterministic Bounds
, 2010
"... We present a new overlay, called the Deterministic Decentralized tree (D²-tree). The D²-tree compares favourably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers) ..."
Abstract
- Add to MetaCart
) and elements are completely decoupled from each other; and (c) an efficient deterministic load-balancing mechanism is presented for the uniform distribution of elements into nodes, while at the same time probabilistic optimal bounds are provided for the congestion of operations at the nodes.
Traffic Characterization and Switch Utilization using a Deterministic Bounding Interval Dependent Traffic Model
- In Proc. IEEE INFOCOM '95
, 1995
"... Compressed digital video is one of the most important types of traffic in future integrated services networks. It is difficult to support this class of traffic since, on one hand, compressed video is bursty, while on the other hand, it requires performance guarantees from the network. The common bel ..."
Abstract
-
Cited by 100 (18 self)
- Add to MetaCart
belief is that we are unlikely to achieve a high network utilization while providing performance guarantees to such bursty sources. In this paper, we introduce a new Deterministic Bounding Interval-Dependent (D-BIND) traffic model, together with tight analysis techniques, to explore the possibility
Predicting Error Floors of Structured LDPC Codes: Deterministic Bounds and Estimates
, 2009
"... The error-correcting performance of low-density parity check (LDPC) codes, when decoded using practical iterative decoding algorithms, is known to be close to Shannon limits for codes with suitably large blocklengths. A substantial limitation to the use of finite-length LDPC codes is the presence o ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
density, appropriately centered between a codeword and a dominant absorbing set, to produce an unbiased estimator of the FER with substantial computational savings over a standard Monte Carlo estimator. Our deterministic estimates are guaranteed to be a lower bound to the error probability in the high SNR
Multiparty Communication Complexity
, 1989
"... A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows that it is possible to obtain the Boo ..."
Abstract
-
Cited by 760 (22 self)
- Add to MetaCart
the Boolean answer deterministically with only a polynomial increase in communication with respect to the information lower bound given by the nondeterministic communication complexity of the function.
A Deterministic Bound for the Access Delay of Resilient Packet Rings
"... Abstract — Resilient Packet Ring (RPR) is a new technology being standardized by the IEEE 802.17 working group. This paper presents a ring access delay bound under steady state. The bound is then proved analytically. Furthermore we show that the bound is tight by constructing a worst-case traffic sc ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract — Resilient Packet Ring (RPR) is a new technology being standardized by the IEEE 802.17 working group. This paper presents a ring access delay bound under steady state. The bound is then proved analytically. Furthermore we show that the bound is tight by constructing a worst-case traffic
D2-Tree: A New Overlay with Deterministic Bounds
- In Algorithms and Computation – ISAAC 2010, Lecture
"... ar ..."
The complexity of theorem-proving procedures
- IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract
-
Cited by 1050 (5 self)
- Add to MetaCart
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding
- IEEE TRANS. ON INFORMATION THEORY
, 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing information-embedding rate, mini ..."
Abstract
-
Cited by 496 (14 self)
- Add to MetaCart
refer to as dither modulation. Using deterministic models to evaluate digital watermarking methods, we show that QIM is "provably good" against arbitrary bounded and fully informed attacks, which arise in several copyright applications, and in particular, it achieves provably better rate
Dynamic Bayesian Networks: Representation, Inference and Learning
, 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and bio-sequence analysis, and KFMs have bee ..."
Abstract
-
Cited by 770 (3 self)
- Add to MetaCart
) space instead of O(T); a simple way of using the junction tree algorithm for online inference in DBNs; new complexity bounds on exact online inference in DBNs; a new deterministic approximate inference algorithm called factored frontier; an analysis of the relationship between the BK algorithm and loopy
Results 1 - 10
of
4,002
