Search Results

An "element-free" probability distribution is what remains of a probability distribution after we forget the elements to which the probabilities were assigned. These objects naturally arise in Bayesian statistics, in situations where elements are used as ...

Recent programming languages research has developed language-integrated query, a convenient technique to seamlessly embed a domain-specific database query language into a general-purpose host programming language; such queries are then automatically ...

An exclusive disjunction is true when exactly one of the disjuncts is true. In the case of the familiar binary exclusive disjunction, we have a formula occurring as the first disjunct and a formula occurring as the second disjunct, so, if what we ...

The new SOCRATES (ShOrtening CRiteria and ATtributES) method for reducing the dimensionality of attribute space is described. In this method, a large number of initial numerical and/or verbal characteristics of objects are aggregated into a ...

Language-integrated query based on comprehension syntax is a powerful technique for safe database programming, and provides a basis for advanced techniques such as query shredding or query flattening that allow efficient programming with complex ...${\mathcal{}}_{}$

In this paper, we examine how we can use data merging techniques to summarize a set of coreferent documents that has been clustered while using soft computing techniques. The main focus of this paper lies on the f_β-optimal merge function ...

This paper describes lossless compression algorithms for multisets of sequences, taking advantage of the multiset's unordered structure. Multisets are a generalization of sets, where members are allowed to occur multiple times. A multiset can be encoded ...

Merge functions informally combine information from a certain universe into a solution over that same universe. This typically results in a, preferably optimal, summarization. In previous research, merge functions over sets have been looked into ...

We study the problem of coding of unordered sets of words, appearing in natural language processing, retrieval, machine learning, computer vision, and other fields. We note that this problem is different from the problem of coding of a particular ...

Description Logics (DLs) are a family of knowledge representation languages that have gained considerable attention the last 20 years. It is wellknown that the interpretation domain of classical DLs is a classical set. However, in Science and in the ...

We study Stirling permutations defined by Gessel and Stanley in [J. Combin. Theory Ser. A, 24 (1978), pp. 25-33]. We prove that their generating function according to the number of descents has real roots only. We use that fact to prove that the ...

We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by characteristic functions from a finite universe (of unknown size) to a user-defined ...

Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of computer science. They have been analyzed from an axiomatic point of view with a parametric approach in Dovier et al. [1998], where the ...

We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,…,m − 1} for some integer m while supporting the operations of rank(x), which returns the number of elements in S that are less than x if x ∈ S, and −1 otherwise; and ...

We give a combinatorial interpretation of the Chebyshev polynomials in terms of the number of ideals of generalized fences and crowns.

Recently, interest in shuffle algebra has been renewed due to their connections with multiple zeta values. In this paper, we prove a new shuffle convolution that implies a reduction formula for the multiple zeta value z({5,1} ⁿ ).

In an anonymous ring of n processors, all processors are totally indistinguishable except for their input values. These values are not necessarily distinct, i.e., they form a multiset, and this makes many problems particularly difficult. We consider the ...

We consider the problem of enumerating the submultisets of a multiset, in which each element has equal multiplicity. The crucial property is that consecutive submultisets in this listing differ one in the cardinality of exactly one of the elements. This ...

Multiset languages are languages defined by multiset grammars in the sense of [4]. We extend to multiset languages the usual operations defined for string languages and define new operations specific for multiset languages. The closure properties of the ...

Numerous frameworks have been proposed in recent years for deductive databases with uncertainty. On the basis of how uncertainty is associated with the facts and rules in a program, we classify these frameworks into implication-based (IB) and annotation-...