Sciweavers

751 search results - page 30 / 151
» The Distinguishing Chromatic Number
Sort
View
IPL
2010
98views more  IPL 2010»
14 years 9 months ago
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...
Nathan Keller, Stephen D. Miller
ICCS
2009
Springer
15 years 5 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
BMCBI
2006
143views more  BMCBI 2006»
14 years 11 months ago
IsoSVM - Distinguishing isoforms and paralogs on the protein level
Background: Recent progress in cDNA and EST sequencing is yielding a deluge of sequence data. Like database search results and proteome databases, this data gives rise to inferred...
Michael Spitzer, Stefan Lorkowski, Paul Cullen, Al...
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
14 years 11 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 1 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...