925 search results - page 53 / 185 » Connectivity on Complete Lattices |
87
Voted
EUROCRYPT
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
IFIP12
2007
15 years 1 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
FSS
2010
14 years 10 months ago
2010
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...
135
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Intelligence analysts grapple with many challenges, chief among them is the need for software support in storytelling, i.e., automatically ‘connecting the dots’ between dispar...
FSS
2006
14 years 12 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...