Sciweavers

4850 search results - page 656 / 970
» Approximate Data Structures with Applications
Sort
View
ICFP
2008
ACM
16 years 6 months ago
Implicitly-threaded parallelism in Manticore
The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-s...
Matthew Fluet, Mike Rainey, John H. Reppy, Adam Sh...
KDD
2009
ACM
217views Data Mining» more  KDD 2009»
16 years 6 months ago
Efficient anomaly monitoring over moving object trajectory streams
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
Yingyi Bu, Lei Chen 0002, Ada Wai-Chee Fu, Dawei L...
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 6 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
KDD
2003
ACM
233views Data Mining» more  KDD 2003»
16 years 6 months ago
SEWeP: using site semantics and a taxonomy to enhance the Web personalization process
Web personalization is the process of customizing a Web site to the needs of each specific user or set of users, taking advantage of the knowledge acquired through the analysis of...
Magdalini Eirinaki, Michalis Vazirgiannis, Iraklis...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 6 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki