Results 1  10
of
3,782
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 516 (16 self)
 Add to MetaCart
We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas
Performance Analysis of the IEEE 802.11 Distributed Coordination Function
, 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract

Cited by 1869 (1 self)
 Add to MetaCart
Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
the convergence the more exact the approximation. • If the hidden nodes are binary, then thresholding the loopy beliefs is guaranteed to give the most probable assignment, even though the numerical value of the beliefs may be incorrect. This result only holds for nodes in the loop. In the maxproduct (or "
Efficient ray tracing of volume data
 ACM Transactions on Graphics
, 1990
"... Volume rendering is a technique for visualizing sampled scalar or vector fields of three spatial dimensions without fitting geometric primitives to the data. A subset of these techniques generates images by computing 2D projections of a colored semitransparent volume, where the color and opacity at ..."
Abstract

Cited by 392 (5 self)
 Add to MetaCart
performance. The first technique employs a pyramid of binary volumes to encode spatial coherence present in the data, and the second technique uses an opacity threshold to adaptively terminate ray tracing. Although the actual time saved depends on the data, speedups of an order of magnitude have been observed
On the design of lowdensity paritycheck codes within 0.0045 dB of the Shannon limit
 IEEE COMMUNICATIONS LETTERS
, 2001
"... We develop improved algorithms to construct good lowdensity paritycheck codes that approach the Shannon limit very closely. For rate 1/2, the best code found has a threshold within 0.0045 dB of the Shannon limit of the binaryinput additive white Gaussian noise channel. Simulation results with a ..."
Abstract

Cited by 306 (6 self)
 Add to MetaCart
We develop improved algorithms to construct good lowdensity paritycheck codes that approach the Shannon limit very closely. For rate 1/2, the best code found has a threshold within 0.0045 dB of the Shannon limit of the binaryinput additive white Gaussian noise channel. Simulation results with a
Spectral hashing
, 2009
"... Semantic hashing [1] seeks compact binary codes of datapoints so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the problem of finding a best code for a given dataset is closely related to the problem of graph partitioning and can be sho ..."
Abstract

Cited by 284 (4 self)
 Add to MetaCart
Semantic hashing [1] seeks compact binary codes of datapoints so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the problem of finding a best code for a given dataset is closely related to the problem of graph partitioning and can
The analysis of visual motion: a comparison of neuronal and psychophysical performance
 Journal of Neuroscience
, 1992
"... We compared the ability of psychophysical observers and single cortical neurons to discriminate weak motion signals in a stochastic visual display. All data were obtained from rhesus monkeys trained to perform a direction discrimination task near psychophysical threshold. The conditions for such a c ..."
Abstract

Cited by 248 (15 self)
 Add to MetaCart
We compared the ability of psychophysical observers and single cortical neurons to discriminate weak motion signals in a stochastic visual display. All data were obtained from rhesus monkeys trained to perform a direction discrimination task near psychophysical threshold. The conditions for such a
Neuronal Population Dynamics with Post Inhibitory Rebound: A Reduction to Piecewise Linear Discontinuous Circle Maps
, 1996
"... Post inhibitory rebound is a nonlinear phenomenon present in a variety of nerve cells. It is an important mechanism underlying central pattern generation for heartbeat, swimming and other motor patterns in many neuronal systems. In this paper we propose an extension of the binary threshold neuron ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Post inhibitory rebound is a nonlinear phenomenon present in a variety of nerve cells. It is an important mechanism underlying central pattern generation for heartbeat, swimming and other motor patterns in many neuronal systems. In this paper we propose an extension of the binary threshold
Fast global oscillations in networks of integrateandfire neurons with low firing rates
 Neural Computation
, 1999
"... We study analytically the dynamics of a network of sparsely connected inhibitory integrateandfire neurons in a regime where individual neurons emit spikes irregularly and at a low rate. In the limit when the number of neurons N → ∞, the network exhibits a sharp transition between a stationary and ..."
Abstract

Cited by 227 (17 self)
 Add to MetaCart
We study analytically the dynamics of a network of sparsely connected inhibitory integrateandfire neurons in a regime where individual neurons emit spikes irregularly and at a low rate. In the limit when the number of neurons N → ∞, the network exhibits a sharp transition between a stationary
Analysis of sumproduct decoding of lowdensity paritycheck codes using a Gaussian approximation
 IEEE TRANS. INFORM. THEORY
, 2001
"... Density evolution is an algorithm for computing the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding. For memoryless binaryinput continuousoutput additive white Gaussian noise (AWGN) channels and sumproduct decoders, we use a Gaussian approximation for message densi ..."
Abstract

Cited by 244 (2 self)
 Add to MetaCart
Density evolution is an algorithm for computing the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding. For memoryless binaryinput continuousoutput additive white Gaussian noise (AWGN) channels and sumproduct decoders, we use a Gaussian approximation for message
Results 1  10
of
3,782