Sciweavers

3360 search results - page 460 / 672
» Opportunistic Data Structures with Applications
Sort
View
ISCI
2008
116views more  ISCI 2008»
15 years 4 months ago
Discovery of maximum length frequent itemsets
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 ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
JBI
2008
137views Bioinformatics» more  JBI 2008»
15 years 4 months ago
Mining sequential patterns for protein fold recognition
Protein data contain discriminative patterns that can be used in many beneficial applications if they are defined correctly. In this work sequential pattern mining (SPM) is utiliz...
Themis P. Exarchos, Costas Papaloukas, Christos La...
FUIN
2002
107views more  FUIN 2002»
15 years 4 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
PC
2007
123views Management» more  PC 2007»
15 years 4 months ago
MPI collective algorithm selection and quadtree encoding
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
129
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
Design and Analysis of a Robust Pipelined Memory System
Abstract—Many network processing applications require wirespeed access to large data structures or a large amount of flowlevel data, but the capacity of SRAMs is woefully inadeq...
Hao Wang, Haiquan (Chuck) Zhao, Bill Lin, Jun Xu