Sciweavers

65 search results - page 4 / 13
» Efficient Memory Bound Puzzles Using Pattern Databases
Sort
View
GIS
2004
ACM
14 years 6 months ago
Efficient detection of motion patterns in spatio-temporal data sets
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
Joachim Gudmundsson, Marc J. van Kreveld, Bettina ...
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 6 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
AAAI
2004
13 years 7 months ago
Space-Efficient Memory-Based Heuristics
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
Rong Zhou, Eric A. Hansen
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 7 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
HICSS
2005
IEEE
164views Biometrics» more  HICSS 2005»
13 years 11 months ago
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications
Association rule mining in real-time is of increasing thrust in many business applications. Applications such as e-commerce, recommender systems, supply-chain management and group...
Rajanish Dass, Ambuj Mahanti