Sciweavers

7123 search results - page 138 / 1425
» The Ordered Set of Rough Sets
Sort
View
JCO
2008
84views more  JCO 2008»
13 years 10 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
ICML
2006
IEEE
14 years 11 months ago
Higher order learning with graphs
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
Sameer Agarwal, Kristin Branson, Serge Belongie
CADE
2006
Springer
14 years 10 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema
TPHOL
2005
IEEE
14 years 3 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
WABI
2004
Springer
14 years 3 months ago
Reconstructing Ancestral Gene Orders Using Conserved Intervals
Conserved intervals were recently introduced as a measure of similarity between genomes whose genes have been shuffled during evolution by genomic rearrangements. Phylogenetic reco...
Anne Bergeron, Mathieu Blanchette, Annie Chateau, ...