65 search results - page 3 / 13 » Efficient Memory Bound Puzzles Using Pattern Databases |
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
SSD
2001
Springer
13 years 9 months ago
2001
Springer
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
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...
CGF
2006
13 years 5 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
COMPSAC
2004
IEEE
13 years 9 months ago
2004
IEEE
Partial periodic patterns mining is a very interesting domain in data mining problem. In the previous studies, full and partial multiple periodic patterns mining problems are cons...