Results 1  10
of
2,530,879
WEAKLY SUFFICIENT SETS FOR A¡1(D)
 PUBLICACIONS MATEMATIQUES, VOL 42 (1998), 435448.
, 1998
"... In the space A¡1(D) of functions of polynomial growth, weakly sufficient sets are those such that the topology induced by restriction to the set coincides with the topology of the original space. Horowitz, Korenblum and Pinchuk deflned sampling sets for A¡1(D) as those such that the restriction of a ..."
Abstract
 Add to MetaCart
In the space A¡1(D) of functions of polynomial growth, weakly sufficient sets are those such that the topology induced by restriction to the set coincides with the topology of the original space. Horowitz, Korenblum and Pinchuk deflned sampling sets for A¡1(D) as those such that the restriction
Strongly sufficient sets and the distribution of arithmetic sequences
 in the 3x + 1 graph, Discrete Mathematics 313
"... The 3x+ 1 Conjecture asserts that the Torbit of every positive integer contains 1, where T maps x 7 → x/2 for x even and x 7 → (3x + 1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer intersects the orbit of some member of S. In [9] it was shown that ev ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The 3x+ 1 Conjecture asserts that the Torbit of every positive integer contains 1, where T maps x 7 → x/2 for x even and x 7 → (3x + 1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer intersects the orbit of some member of S. In [9] it was shown
SETS OF UNIQUENESS, WEAKLY SUFFICIENT SETS AND SAMPLING SETS FOR A−∞(B)
"... Abstract. We study a relationship between sets of uniqueness, weakly sufficient sets and sampling sets in the space A−∞(B) of holomorphic functions with polynomial growth on the unit ball of Cn (n ≥ 1). 1. ..."
Abstract
 Add to MetaCart
Abstract. We study a relationship between sets of uniqueness, weakly sufficient sets and sampling sets in the space A−∞(B) of holomorphic functions with polynomial growth on the unit ball of Cn (n ≥ 1). 1.
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 778 (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 NP
The pyramid match kernel: Discriminative classification with sets of image features
 IN ICCV
, 2005
"... Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve for correspondenc ..."
Abstract

Cited by 546 (29 self)
 Add to MetaCart
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve
An extended set of Haarlike features for rapid objection detection
 IEEE ICIP
"... Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haarlike features. These novel features significantly enrich the simple features of [5] and can also be calculated ef ..."
Abstract

Cited by 567 (4 self)
 Add to MetaCart
Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haarlike features. These novel features significantly enrich the simple features of [5] and can also be calculated
A standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity
 JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN LEARNING AND MEMORY
, 1980
"... In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial represent ..."
Abstract

Cited by 615 (1 self)
 Add to MetaCart
In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial
A yieldfactor model of interest rates
 Math. Finance
, 1996
"... This paper presents a consistent and arbitragefree multifactor model of the term structure of interest rates in which yields at selected fixed maturities follow a parametric multivariate Markov diffusion process with “stochastic volatility. ” The yield of any zerocoupon bond is taken to be a matur ..."
Abstract

Cited by 657 (24 self)
 Add to MetaCart
maturitydependent affine combination of the selected “basis ” set of yields. We provide necessary and sufficient conditions on the stochastic model for this affine representation. We include numerical techniques for solving the model, as wcll as numerical techniques for calculating the prices of term
Results 1  10
of
2,530,879