541 search results - page 89 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
RSP
1998
IEEE
14 years 26 days ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
TASE
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
ISCI
2008
13 years 8 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
VLDB
1998
ACM
14 years 25 days ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
CIKM
2006
Springer
14 years 11 days ago
2006
Springer
In many applications, classifiers need to be built based on multiple related data streams. For example, stock streams and news streams are related, where the classification patter...