Results 1  10
of
2,661
Nonuniform ACC circuit lower bounds
, 2010
"... The class ACC consists of circuit families with constant depth over unbounded fanin AND, OR, NOT, and MODm gates, where m> 1 is an arbitrary constant. We prove: • NTIME[2 n] does not have nonuniform ACC circuits of polynomial size. The size lower bound can be slightly strengthened to quasipoly ..."
Abstract

Cited by 51 (8 self)
 Add to MetaCart
The class ACC consists of circuit families with constant depth over unbounded fanin AND, OR, NOT, and MODm gates, where m> 1 is an arbitrary constant. We prove: • NTIME[2 n] does not have nonuniform ACC circuits of polynomial size. The size lower bound can be slightly strengthened to quasi
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
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
nothing directly to do with coding or decoding will show that in some sense belief propagation "converges with high probability to a nearoptimum value" of the desired belief on a class of loopy DAGs Progress in the analysis of loopy belief propagation has been made for the case of networks
The SRtree: An Index Structure for HighDimensional Nearest Neighbor Queries
, 1997
"... Recently, similarity queries on feature vectors have been widely used to perform contentbased retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor queries e ciently. The SStree had been proposed for ..."
Abstract

Cited by 438 (3 self)
 Add to MetaCart
and nonuniform data which can be practical in actual image/video similarity indexing. We include the performance test results that verify this advantage of the SRtree and show that the SRtree outperforms both the SStree and the R*tree.
Classification of Wetlands and Deepwater Habitats of the United States
 FWS/OBS79/31. USDI, U.S. Fish and Wildlife Service, Office of Biological Service. 103
, 1979
"... This classification, to be used in a new inventory of wetlands and deepwater habitats of the United States, is intended to describe ecological taxa, arrange them in a system useful to resource managers, furnish units for mapping, and provide uniformity of concepts and terms. Wetlands are defined by ..."
Abstract

Cited by 411 (1 self)
 Add to MetaCart
This classification, to be used in a new inventory of wetlands and deepwater habitats of the United States, is intended to describe ecological taxa, arrange them in a system useful to resource managers, furnish units for mapping, and provide uniformity of concepts and terms. Wetlands are defined
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 376 (38 self)
 Add to MetaCart
for this representation structure. We apply this procedure and the automatatheoretic approach to modelchecking to define new modelchecking algorithms for pushdown systems and both linear and branchingtime properties. From these results we derive upper bounds for several modelchecking problems, and we also provide
Nonuniform deblurring for shaken images
 In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2010. 8. Image taken with a Canon 1D Mark III, at 35mm f/4.5. Images
"... Blur from camera shake is mostly due to the 3D rotation of the camera, resulting in a blur kernel that can be significantly nonuniform across the image. However, most current deblurring methods model the observed image as a convolution of a sharp image with a uniform blur kernel. We propose a new p ..."
Abstract

Cited by 75 (4 self)
 Add to MetaCart
Blur from camera shake is mostly due to the 3D rotation of the camera, resulting in a blur kernel that can be significantly nonuniform across the image. However, most current deblurring methods model the observed image as a convolution of a sharp image with a uniform blur kernel. We propose a new
Nonuniform integrability and generalized Young measures,
 J. Convex Anal.
, 1997
"... Given a bounded sequence (u n ) in L 1 (Ω, µ; IR d ), we describe the weak limits in the sense of measures of f (x, u n ) µ for a class of continuous integrands with linear growth at infinity. The defect of uniform integrability of the sequence f (x, u n ) is described by a measure m and a family o ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
Given a bounded sequence (u n ) in L 1 (Ω, µ; IR d ), we describe the weak limits in the sense of measures of f (x, u n ) µ for a class of continuous integrands with linear growth at infinity. The defect of uniform integrability of the sequence f (x, u n ) is described by a measure m and a family
Nonuniform Hard Boolean Functions and Uniform Complexity Classes
, 2001
"... Uniform complexity classes are typically de ned in terms of resourcebounded Turing machines, while nonuniform complexity classes in terms of families of Boolean circuits of bounded size. It is well known that superpolynomial circuit lower bounds for NP would imply that P 6= NP. Interestingly, the ..."
Abstract
 Add to MetaCart
Uniform complexity classes are typically de ned in terms of resourcebounded Turing machines, while nonuniform complexity classes in terms of families of Boolean circuits of bounded size. It is well known that superpolynomial circuit lower bounds for NP would imply that P 6= NP. Interestingly
Sampling signals with finite rate of innovation
 IEEE Transactions on Signal Processing
, 2002
"... Abstract—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials ..."
Abstract

Cited by 350 (67 self)
 Add to MetaCart
Abstract—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise
Results 1  10
of
2,661