Sciweavers

1117 search results - page 44 / 224
» Equivalent Representations of Set Functions
Sort
View
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 1 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin
FSTTCS
2004
Springer
15 years 3 months ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
DM
1998
54views more  DM 1998»
14 years 9 months ago
On the structure of a random sum-free set of positive integers
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...
Neil J. Calkin
FUZZIEEE
2007
IEEE
15 years 4 months ago
Genetic Learning of Membership Functions for Mining Fuzzy Association Rules
— Data mining is most commonly used in attempts to induce association rules from transaction data. Most previous studies focused on binary-valued transaction data. Transaction da...
Rafael Alcalá, Jesús Alcalá-F...
NIPS
2004
14 years 11 months ago
Semigroup Kernels on Finite Sets
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of posi...
Marco Cuturi, Jean-Philippe Vert