Results 1  10
of
6,903
Linear multiuser detectors for synchronous codedivision multipleaccess channels
 IEEE TRANS. INFORM. THEORY
, 1989
"... In codedivision multipleaccess systems, simultaneous multiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum of the transmitt ..."
Abstract

Cited by 385 (4 self)
 Add to MetaCart
. It is shown that in the synchronous case the performance achieved by linear multiuser detectors (whose complexity per demodulated bit is only linear in the number of users) is similar to that of optimum multiuser detection. Attention is focused on detectors whose linear memoryless transformation is a general
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum
Learning to detect natural image boundaries using local brightness, color, and texture cues
 PAMI
, 2004
"... The goal of this work is to accurately detect and localize boundaries in natural scenes using local image measurements. We formulate features that respond to characteristic changes in brightness, color, and texture associated with natural boundaries. In order to combine the information from these fe ..."
Abstract

Cited by 625 (18 self)
 Add to MetaCart
these features in an optimal way, we train a classifier using human labeled images as ground truth. The output of this classifier provides the posterior probability of a boundary at each image location and orientation. We present precisionrecall curves showing that the resulting detector significantly
Iterative (turbo) soft interference cancellation and decoding for coded CDMA
 IEEE Trans. Commun
, 1999
"... Abstract — The presence of both multipleaccess interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath codedivision multipleaccess (CDMA) channels. In this paper, an iterative receiver structure is proposed for decoding multiuse ..."
Abstract

Cited by 456 (18 self)
 Add to MetaCart
computational complexity. A lowcomplexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft interference cancellation and instantaneous linear minimum meansquare error filtering. The properties of such a nonlinear interference
Blind Adaptive Multiuser Detection
 IEEE TRANS. INFORM. THEORY
, 1995
"... The decorrelating detector and the linear minimum meansquare error (MMSE) detector are known to be effective strategies to counter the presence of multiuser interference in codedivision multipleaccess channels; in particular, those multiuser detectors provide optimum nearfar resistance. When tr ..."
Abstract

Cited by 353 (16 self)
 Add to MetaCart
The decorrelating detector and the linear minimum meansquare error (MMSE) detector are known to be effective strategies to counter the presence of multiuser interference in codedivision multipleaccess channels; in particular, those multiuser detectors provide optimum nearfar resistance. When
The minimum description length principle in coding and modeling
 IEEE TRANS. INFORM. THEORY
, 1998
"... We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized ..."
Abstract

Cited by 394 (18 self)
 Add to MetaCart
We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 397 (2 self)
 Add to MetaCart
Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes
Submodular functions, matroids and certain polyhedra
, 2003
"... The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all ..."
Abstract

Cited by 355 (0 self)
 Add to MetaCart
is that all bases have the same cardinality. (See Van der Waerden, Section 33.) From the viewpoint of mathematical programming, the equal cardinality of all bases has special meaning — namely, that every basis is an optimumcardinality basis. We are thus prompted to study this simple property in the context
Nonlinear spatial normalization using basis functions
 Human Brain Mapping
, 1999
"... Abstract: We describe a comprehensive framework for performing rapid and automatic nonlabelbased nonlinear spatial normalizations. The approach adopted minimizes the residual squared difference between an image and a template of the same modality. In order to reduce the number of parameters to be f ..."
Abstract

Cited by 329 (19 self)
 Add to MetaCart
to be fitted, the nonlinear warps are described by a linear combination of low spatial frequency basis functions. The objective is to determine the optimum coefficients for each of the bases by minimizing the sum of squared differences between the image and template, while simultaneously maximizing
Sharing Visual Features for Multiclass And Multiview Object Detection
, 2004
"... We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifiers to the image, at multiple locations and scales. This can be slow and can require a lot of training data, since each clas ..."
Abstract

Cited by 279 (6 self)
 Add to MetaCart
classifier requires the computation of many different image features. In particular, for independently trained detectors, the (runtime) computational complexity, and the (trainingtime) sample complexity, scales linearly with the number of classes to be detected. It seems unlikely that such an approach
Results 1  10
of
6,903