4488 search results - page 340 / 898 » Properties of NP-Complete Sets |
180
click to vote
FLAIRS
2003
15 years 9 months ago
2003
This paper presents new technique for discovering temporal patterns when considered primitives are intervals. Apriori technique is the most used one to deal with temporal patterns...
195
click to vote
WAE
1998
15 years 9 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
186
click to vote
DAWAK
2010
Springer
15 years 8 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
183
click to vote
PR
2008
15 years 7 months ago
2008
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
224
click to vote
TCAD
1998
15 years 7 months ago
1998
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...