1284 search results - page 201 / 257 » Data Structures for Mergeable Trees |
AUSDM
2007
Springer
15 years 4 months ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
113
click to vote
SIGGRAPH
1998
ACM
15 years 2 months ago
1998
ACM
Virtual environment research has focused on interactive image generation and has largely ignored acoustic modeling for spatialization of sound. Yet, realistic auditory cues can co...
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, a method based on wavelet coefficients in low-pass bands is proposed for the image classification with adaptive processing of data structures to organize a large...