280 search results - page 42 / 56 » New Algorithms for Enumerating All Maximal Cliques |
100
click to vote
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
KDID
2004
14 years 11 months ago
2004
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
82
Voted
KDD
1999
ACM
15 years 1 months ago
1999
ACM
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
110
Voted
FPGA
2000
ACM
15 years 1 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...