Results 1  10
of
2,951
Bounds on Special Subsets in Graphs, Eigenvalues
, 1996
"... Link to publication Citation for published version (APA): van Dam, E. R. (1998). Bounds on special subsets in graphs, eigenvalues and association schemes. Journal of Algebraic Combinatorics, 7(3), 321332. General rights Copyright and moral rights for the publications made accessible in the public p ..."
Abstract
 Add to MetaCart
Link to publication Citation for published version (APA): van Dam, E. R. (1998). Bounds on special subsets in graphs, eigenvalues and association schemes. Journal of Algebraic Combinatorics, 7(3), 321332. General rights Copyright and moral rights for the publications made accessible in the public
The distribution of special subsets of the Farey sequence
 J. Number Theory
"... Abstract. We will examine the subset FQ,p of Farey fractions of order Q consisting of those fractions whose denominators are not divisible by a fixed prime p. In particular, we will provide an asymptotic result on the distribution of H−tuples of consecutive fractions in FQ,p, as Q → ∞. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We will examine the subset FQ,p of Farey fractions of order Q consisting of those fractions whose denominators are not divisible by a fixed prime p. In particular, we will provide an asymptotic result on the distribution of H−tuples of consecutive fractions in FQ,p, as Q → ∞.
SPECIAL SUBSETS OF THE REALS AND TREE FORCING NOTIONS
"... (Communicated by Julia Knight) Abstract. We study relationships between classes of special subsets of the reals (e.g. meageradditive sets, γsets, C ′ ′sets, λsets) and the ideals related to the forcing notions of Laver, Mathias, Miller and Silver. 1. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Communicated by Julia Knight) Abstract. We study relationships between classes of special subsets of the reals (e.g. meageradditive sets, γsets, C ′ ′sets, λsets) and the ideals related to the forcing notions of Laver, Mathias, Miller and Silver. 1.
Integrating classification and association rule mining
 In Proc of KDD
, 1998
"... Classification rule mining aims to discover a small set of rules in the database that forms an accurate classifier. Association rule mining finds all the rules existing in the database that satisfy some minimum support and minimum confidence constraints. For association rule mining, the target of di ..."
Abstract

Cited by 578 (21 self)
 Add to MetaCart
of discovery is not predetermined, while for classification rule mining there is one and only one predetermined target. In this paper, we propose to integrate these two mining techniques. The integration is done by focusing on mining a special subset of association rules, called class association rules (CARs
ON THE CARDINALITY OF RINGS WITH SPECIAL SUBSETS WHICH ARE FINITE
"... ABSTRACT. We investigate the cardinality and structure of a ring whose set of algebraic elements is finite, or when the ring has an involution whose set of symmetric elements is finite. In the first case, the subring generated by the algebraic elements is always finite, as is the subring generated b ..."
Abstract
 Add to MetaCart
. The first of these showed that if in a ring R the set H, or the subset H2 of elements of square zero, is finite, then
SPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS
"... Abstract. This article introduces a new approach to studying difference sets via their additive properties. We introduce the concept of special subsets, which are interesting combinatorial objects in their own right, but also provide a mechanism for measuring additive regularity. Skew Hadamard diffe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. This article introduces a new approach to studying difference sets via their additive properties. We introduce the concept of special subsets, which are interesting combinatorial objects in their own right, but also provide a mechanism for measuring additive regularity. Skew Hadamard
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ¹ minimization
 PROC. NATL ACAD. SCI. USA 100 2197–202
, 2002
"... Given a ‘dictionary’ D = {dk} of vectors dk, we seek to represent a signal S as a linear combination S = ∑ k γ(k)dk, with scalar coefficients γ(k). In particular, we aim for the sparsest representation possible. In general, this requires a combinatorial optimization process. Previous work considered ..."
Abstract

Cited by 633 (38 self)
 Add to MetaCart
considered the special case where D is an overcomplete system consisting of exactly two orthobases, and has shown that, under a condition of mutual incoherence of the two bases, and assuming that S has a sufficiently sparse representation, this representation is unique and can be found by solving a convex
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
to work well. In this paper we investigate loopy prop agation empirically under a wider range of conditions. Is there something special about the errorcorrecting code setting, or does loopy propagation work as an approximation scheme for a wider range of networks? ..\ x(:x).) (1) where: and: The message
Special Subsets of cf(µ) µ, Boolean Algebras and Maharam measure Algebras
, 1998
"... The original theme of the paper is the existence proof of “there is ¯η = 〈ηα: α < λ 〉 which is a (λ, J)sequence for Ī = 〈Ii: i < δ〉, a sequence of ideals. This can be thought of as in a generalization to Luzin sets and Sierpinski sets, but for the product ∏ i<δ dom(Ii), the existence proof ..."
Abstract

Cited by 14 (13 self)
 Add to MetaCart
The original theme of the paper is the existence proof of “there is ¯η = 〈ηα: α < λ 〉 which is a (λ, J)sequence for Ī = 〈Ii: i < δ〉, a sequence of ideals. This can be thought of as in a generalization to Luzin sets and Sierpinski sets, but for the product ∏ i<δ dom(Ii), the existence proofs are related to pcf. The second theme is when does a Boolean algebra B has free caliber λ (i.e. if X ⊆ B and X  = λ, then for some Y ⊆ X with Y  = λ and Y is independent). We consider it for B being a Maharam measure algebra, or B a (small) product of free Boolean algebras, and κcc Boolean algebras. A central case λ = (ℶω) + or more generally, λ = µ + for µ strong limit singular of “small ” cofinality. A second one is µ = µ <κ < λ < 2 µ; the main case is λ regular but we also have things to say on the singular case. Lastly, we deal with ultraproducts of Boolean algebras in relation to irr() and s() etc.
Results 1  10
of
2,951