Sciweavers

559 search results - page 41 / 112
» Algorithms and Data Structures for External Memory
Sort
View
JPDC
2006
111views more  JPDC 2006»
15 years 2 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
SSDBM
1990
IEEE
94views Database» more  SSDBM 1990»
15 years 6 months ago
Random Sampling from Database Files: A Survey
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
Frank Olken, Doron Rotem
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
15 years 8 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni
CVPR
2010
IEEE
15 years 4 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ECAI
2004
Springer
15 years 7 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...