Results 1  10
of
4,423
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 776 (5 self)
 Add to MetaCart
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhard
Constrained model predictive control: Stability and optimality
 AUTOMATICA
, 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract

Cited by 738 (16 self)
 Add to MetaCart
and the first control in this sequence is applied to the plant. An important advantage of this type of control is its ability to cope with hard constraints on controls and states. It has, therefore, been widely applied in petrochemical and related industries where satisfaction of constraints is particularly
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
HardCore Distributions for Somewhat Hard Problems
 In 36th Annual Symposium on Foundations of Computer Science
, 1995
"... Consider a decision problem that cannot be 1 \Gamma ffi approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a ffi fraction of instances. We show that for any such problem there is a specific "hardcore" set of inputs whic ..."
Abstract

Cited by 123 (11 self)
 Add to MetaCart
Consider a decision problem that cannot be 1 \Gamma ffi approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a ffi fraction of instances. We show that for any such problem there is a specific "hardcore" set of inputs
Shape Descriptors for Nonrigid Shapes with a Single Closed Contour
 Proc. IEEE Conf. Computer Vision and Pattern Recognition
, 2000
"... The Core Experiment CEShape1 for shape descriptors performed for the MPEG7 standard gave a unique opportunity to compare various shape descriptors for nonrigid shapes with a single closed contour. There are two main differences with respect to other comparison results reported in the literature: ..."
Abstract

Cited by 185 (19 self)
 Add to MetaCart
The Core Experiment CEShape1 for shape descriptors performed for the MPEG7 standard gave a unique opportunity to compare various shape descriptors for nonrigid shapes with a single closed contour. There are two main differences with respect to other comparison results reported in the literature
A Fine is a Price.”
 Journal of Legal Studies
, 2000
"... Abstract The deterrence hypothesis predicts that the introduction of a penalty that leaves everything else unchanged will reduce the occurrence of the behavior subject to the fine. We present the result of a field study in a group of daycare centers that contradicts this prediction. Parents used t ..."
Abstract

Cited by 249 (9 self)
 Add to MetaCart
to arrive late to collect their children, forcing a teacher to stay after closing time. We introduced a monetary fine for latecoming parents. As a result, the number of latecoming parents increased significantly. After the fine was removed no reduction occurred. We argue that penalties are usually
Generating NonRedundant Association Rules
, 2000
"... The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for associations based on the novel concept of closed frequent itemsets. The number of nonredundant rules produced by the n ..."
Abstract

Cited by 242 (11 self)
 Add to MetaCart
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for associations based on the novel concept of closed frequent itemsets. The number of nonredundant rules produced
Certificateless Public Key Cryptography
 ASIACRYPT'03
, 2003
"... This paper introduces the concept of certificateless public key cryptography (CLPKC). In contrast to traditional public key cryptographic systems, CLPKC does not require the use of certificates to guarantee the authenticity of public keys. It does rely on the use of a trusted third party (TTP) who ..."
Abstract

Cited by 240 (4 self)
 Add to MetaCart
PKE. We prove that our CLPKE scheme is secure in a fully adaptive adversarial model, provided that an underlying problem closely related to the Bilinear DiffieHellman Problem is hard.
Generating Hard Instances of Lattice Problems (Extended Abstract)
 In Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing
, 1996
"... . We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which finds a short vector in a random lattice with a probability of at least 1 2 then there is also a probabilistic polynomial time algorithm which solves the following three lattice probl ..."
Abstract

Cited by 143 (0 self)
 Add to MetaCart
problems in every lattice in Z n with a probability exponentially close to one. (1) Find the length of a shortest nonzero vector in an ndimensional lattice, approximately, up to a polynomial factor. (2) Find the shortest nonzero vector in an ndimensional lattice L where the shortest vector v is unique
Improved lowdensity paritycheck codes using irregular graphs
 IEEE Trans. Inform. Theory
, 2001
"... Abstract—We construct new families of errorcorrecting codes based on Gallager’s lowdensity paritycheck codes. We improve on Gallager’s results by introducing irregular paritycheck matrices and a new rigorous analysis of harddecision decoding of these codes. We also provide efficient methods for ..."
Abstract

Cited by 223 (15 self)
 Add to MetaCart
Abstract—We construct new families of errorcorrecting codes based on Gallager’s lowdensity paritycheck codes. We improve on Gallager’s results by introducing irregular paritycheck matrices and a new rigorous analysis of harddecision decoding of these codes. We also provide efficient methods
Results 1  10
of
4,423