Sciweavers

4850 search results - page 916 / 970
» Approximate Data Structures with Applications
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 2 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SAC
2009
ACM
15 years 8 months ago
Attention driven visual processing for an interactive dialog robot
In this paper we propose an attention-based vision system for the JAST interactive dialog robot. The robotic vision system incorporates three submodules: object recognition, gestu...
Thomas Müller, Alois Knoll
BIRTHDAY
2009
Springer
15 years 8 months ago
Vertical Object Layout and Compression for Fixed Heaps
Research into embedded sensor networks has placed increased focus on the problem of developing reliable and flexible software for microcontroller-class devices. Languages such as ...
Ben Titzer, Jens Palsberg
SEMWEB
2009
Springer
15 years 8 months ago
What Four Million Mappings Can Tell You about Two Hundred Ontologies
The field of biomedicine has embraced the Semantic Web probably more than any other field. As a result, there is a large number of biomedical ontologies covering overlapping area...
Amir Ghazvinian, Natalya Fridman Noy, Clement Jonq...
CCGRID
2007
IEEE
15 years 8 months ago
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
Hui Li