29 search results - page 4 / 6 » Faster Algorithms for Constructing a Concept (Galois) Lattic... |
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
INFOSCALE
2006
ACM
14 years 1 months ago
2006
ACM
With the rapid development of the semantic web, it is likely that the number of ontologies will greatly increase during the next few years, which leads to the arising demand for r...
APN
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we develop the theory of a new class of two dimensional arrays with sensors on lattice(s) which can be used to construct a virtual array of much larger size through...