1819 search results - page 34 / 364 » Computability and Representations of the Zero Set |
79
Voted
APPINF
2003
14 years 11 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
RELMICS
2009
Springer
15 years 4 months ago
2009
Springer
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to ...
CLUSTER
2006
IEEE
15 years 3 months ago
2006
IEEE
Collective MPI operations are an interesting research topic, since their implementation is complex and there are many different possible ways to improve their performance. It is no...
MFCS
1995
Springer
15 years 1 months ago
1995
Springer
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a new method for compact representation of large image datasets. Our method is based on treating small patches from an image as matrices as opposed to the conventional ...