Results 1  10
of
16,037
Set Covering with Our Eyes Closed
"... Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to apriori map each element u ∈ UtoasetS(u) ∈ S containing u, so that X ⊆ U is covered by S(X) =∪u∈XS(u). The aim is finding a mapping such that the cost of S(X) is as close as possib ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to apriori map each element u ∈ UtoasetS(u) ∈ S containing u, so that X ⊆ U is covered by S(X) =∪u∈XS(u). The aim is finding a mapping such that the cost of S(X) is as close
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
hard. We prove that (1 \Gamma o(1)) ln n is a threshold below which set cover cannot be approximated efficiently, unless NP has slightly superpolynomial time algorithms. This closes the gap (up to low order terms) between the ratio of approximation achievable by the greedy algorithm (which is (1 \Gamma
Shape modeling with front propagation: A level set approach
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1995
"... Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods and over ..."
Abstract

Cited by 808 (20 self)
 Add to MetaCart
comes some of their limitations. Our techniques can be applied to model arbitrarily complex shapes, which include shapes with significant protrusions, and to situations where no a priori assumption about the object’s topology is made. A single instance of our model, when presented with an image having more
The PARSEC benchmark suite: Characterization and architectural implications
 IN PRINCETON UNIVERSITY
, 2008
"... This paper presents and characterizes the Princeton Application Repository for SharedMemory Computers (PARSEC), a benchmark suite for studies of ChipMultiprocessors (CMPs). Previous available benchmarks for multiprocessors have focused on highperformance computing applications and used a limited ..."
Abstract

Cited by 518 (4 self)
 Add to MetaCart
number of synchronization methods. PARSEC includes emerging applications in recognition, mining and synthesis (RMS) as well as systems applications which mimic largescale multithreaded commercial programs. Our characterization shows that the benchmark suite covers a wide spectrum of working sets
ANALYSIS OF WIRELESS SENSOR NETWORKS FOR HABITAT MONITORING
, 2004
"... We provide an indepth study of applying wireless sensor networks (WSNs) to realworld habitat monitoring. A set of system design requirements were developed that cover the hardware design of the nodes, the sensor network software, protective enclosures, and system architecture to meet the require ..."
Abstract

Cited by 1490 (19 self)
 Add to MetaCart
We provide an indepth study of applying wireless sensor networks (WSNs) to realworld habitat monitoring. A set of system design requirements were developed that cover the hardware design of the nodes, the sensor network software, protective enclosures, and system architecture to meet
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
, 2008
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract

Cited by 535 (38 self)
 Add to MetaCart
for various measures of “closeness” of input data, such as Hamming distance, edit distance, and set difference.
Lightness and Retinex Theory
 JOURNAL OF THE OPTICAL SOCIETY OF AMERICA
, 1971
"... Sensations of color show a strong correlation with reflectance, even though the amount of visible light reaching the eye depends on the product of reflectance and illumination. The visual system must achieve this remarkable result by a scheme that does not measure flux. Such a scheme is described as ..."
Abstract

Cited by 497 (6 self)
 Add to MetaCart
to our eye; we think that in a particular scene there is more light coming from
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
important because efficiency demands operating points on or close to the boundary of the set of admissible states and controls. In this review, we focus on model predictive control of constrained systems, both linear and nonlinear and discuss only briefly model predictive control of unconstrained nonlinear
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 506 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
Cooperative diversity in wireless networks: efficient protocols and outage behavior
 IEEE TRANS. INFORM. THEORY
, 2004
"... We develop and analyze lowcomplexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies ..."
Abstract

Cited by 2009 (31 self)
 Add to MetaCart
the destination terminal. We develop performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading, focusing on the high signaltonoise ratio (SNR) regime. Except for fixed decodeandforward, all of our cooperative diversity
Results 1  10
of
16,037