541 search results - page 86 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
EUROPAR
2010
Springer
13 years 9 months ago
2010
Springer
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
DASFAA
2005
IEEE
2005
IEEE
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
14 years 2 months ago
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...