2286 search results - page 169 / 458 » Algorithms for Categorical Equivalence |
82
Voted
FIMI
2004
14 years 11 months ago
2004
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
104
click to vote
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
109
Voted
DKE
2002
14 years 10 months ago
2002
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...