Results 1 - 10 of 10,241

Cooperative strategies and capacity theorems for relay networks

by Gerhard Kramer, Michael Gastpar, Piyush Gupta - IEEE TRANS. INFORM. THEORY , 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract - Cited by 739 (19 self) - Add to MetaCart
of multihopping, but in addition to having the relays successively decode the message, the transmitters cooperate and each receiver uses several or all of its past channel output blocks to decode. For the compress-and-forward scheme, the relays take advantage of the statistical dependence between their channel

The strength of weak learnability

by Robert E. Schapire - MACHINE LEARNING , 1990
"... This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distribution-free (PAC) learning model. A concept class is learnable (or strongly learnable) if, given access to a Source of examples of the unknown concept, the learner with high prob ..."
Abstract - Cited by 871 (26 self) - Add to MetaCart
This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distribution-free (PAC) learning model. A concept class is learnable (or strongly learnable) if, given access to a Source of examples of the unknown concept, the learner with high

Online Learning with Kernels

by Jyrki Kivinen, Alexander J. Smola, Robert C. Williamson , 2003
"... Kernel based algorithms such as support vector machines have achieved considerable success in various problems in the batch setting where all of the training data is available in advance. Support vector machines combine the so-called kernel trick with the large margin idea. There has been little u ..."
Abstract - Cited by 2831 (123 self) - Add to MetaCart
derive worst case loss bounds and moreover we show the convergence of the hypothesis to the minimiser of the regularised risk functional. We present some experimental results that support the theory as well as illustrating the power of the new algorithms for online novelty detection. In addition

A theory of social comparison processes,”

by Leon Festinger - Human Relations, , 1954
"... In this paper we shall present a further development of a previously published theory concerning opinion influence processes in social groups (7). This further development has enabled us to extend the theory to deal with other areas, in addition to opinion formation, in which social comparison is i ..."
Abstract - Cited by 1318 (0 self) - Add to MetaCart
In this paper we shall present a further development of a previously published theory concerning opinion influence processes in social groups (7). This further development has enabled us to extend the theory to deal with other areas, in addition to opinion formation, in which social comparison

Combined Object Categorization and Segmentation With An Implicit Shape Model

by Bastian Leibe, Ales Leonardis, Bernt Schiele - In ECCV workshop on statistical learning in computer vision , 2004
"... We present a method for object categorization in real-world scenes. Following a common consensus in the field, we do not assume that a figure-ground segmentation is available prior to recognition. However, in contrast to most standard approaches for object class recognition, our approach automatical ..."
Abstract - Cited by 406 (10 self) - Add to MetaCart
automatically segments the object as a result of the categorization. This combination of recognition and segmentation into one process is made possible by our use of an Implicit Shape Model, which integrates both capabilities into a common probabilistic framework. In addition to the recognition and segmentation

A new method for non-parametric multivariate analysis of variance in ecology.

by Marti J Anderson - Austral Ecology, , 2001
"... Abstract Hypothesis-testing methods for multivariate data are needed to make rigorous probability statements about the effects of factors and their interactions in experiments. Analysis of variance is particularly powerful for the analysis of univariate data. The traditional multivariate analogues, ..."
Abstract - Cited by 368 (4 self) - Add to MetaCart
Abstract Hypothesis-testing methods for multivariate data are needed to make rigorous probability statements about the effects of factors and their interactions in experiments. Analysis of variance is particularly powerful for the analysis of univariate data. The traditional multivariate analogues

On-line selection of discriminative tracking features

by Robert T. Collins, Yanxi Liu, Marius Leordeanu , 2003
"... This paper presents an on-line feature selection mechanism for evaluating multiple features while tracking and adjusting the set of features used to improve tracking performance. Our hypothesis is that the features that best discriminate between object and background are also best for track-ing the ..."
Abstract - Cited by 356 (5 self) - Add to MetaCart
This paper presents an on-line feature selection mechanism for evaluating multiple features while tracking and adjusting the set of features used to improve tracking performance. Our hypothesis is that the features that best discriminate between object and background are also best for track-ing

Ultraconservative Online Algorithms for Multiclass Problems

by Koby Crammer, Yoram Singer - Journal of Machine Learning Research , 2001
"... In this paper we study online classification algorithms for multiclass problems in the mistake bound model. The hypotheses we use maintain one prototype vector per class. Given an input instance, a multiclass hypothesis computes a similarity-score between each prototype and the input instance and th ..."
Abstract - Cited by 320 (21 self) - Add to MetaCart
In this paper we study online classification algorithms for multiclass problems in the mistake bound model. The hypotheses we use maintain one prototype vector per class. Given an input instance, a multiclass hypothesis computes a similarity-score between each prototype and the input instance

Wireless Network Information Flow: A Deterministic Approach

by A. Salman Avestimehr, et al. , 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract - Cited by 296 (42 self) - Add to MetaCart
In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model

Cultivating competence, self-efficacy, and intrinsic interest through proximal self-motivation.

by Albert Bandura , Dale H Schunk Bandura , A Schunk , D H - Journal of Personality and Social Psychology, , 1981
"... Abstract: The present experiment tested the hypothesis that self-motivation through proximal goal setting serves as an effective mechanism for cultivating competencies, self-percepts of efficacy, and intrinsic interest. Children who exhibited gross deficits and disinterest in mathematical tasks pur ..."
Abstract - Cited by 295 (6 self) - Add to MetaCart
Abstract: The present experiment tested the hypothesis that self-motivation through proximal goal setting serves as an effective mechanism for cultivating competencies, self-percepts of efficacy, and intrinsic interest. Children who exhibited gross deficits and disinterest in mathematical tasks
Results 1 - 10 of 10,241