4218 search results - page 416 / 844 » Complete sets of cooperations |
212
click to vote
TSMC
2002
15 years 7 months ago
2002
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
297
click to vote
VLDB
2007
ACM
16 years 8 months ago
2007
ACM
Although the presence of a schema enables many optimizations for operations on XML documents, recent studies have shown that many XML documents in practice either do not refer to ...
223
click to vote
SDM
2003
SIAM
15 years 9 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
256
click to vote
AAAI
1994
15 years 9 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
198
click to vote
KAIS
2008
15 years 7 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...