Sciweavers

1029 search results - page 40 / 206
» Compact representations of ordered sets
Sort
View
135
Voted
ORDER
2006
154views more  ORDER 2006»
15 years 2 months ago
A Bipartite Analogue of Dilworth's Theorem
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
Jacob Fox
211
Voted
IJISEC
2007
66views more  IJISEC 2007»
15 years 2 months ago
Protecting data privacy through hard-to-reverse negative databases
The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set DB of data elements can be represented in terms of its complement set...
Fernando Esponda, Elena S. Ackley, Paul Helman, Ha...
123
Voted
ICML
2006
IEEE
16 years 3 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
125
Voted
WABI
2004
Springer
15 years 8 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, ...
112
Voted
ICASSP
2008
IEEE
15 years 9 months ago
Modeling regulatory sites with higher order position-dependent weight matrices
Identification of regulatory signals in DNA depends on the nature and quality of the patterns of representative sequences. These patterns are constructed from training sets of se...
Hossein Zare, Mostafa Kaveh, Arkady B. Khodursky