Sciweavers

410 search results - page 62 / 82
» Objective and Subjective Algorithms for Grouping Association...
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 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
ATAL
2003
Springer
14 years 1 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
ECCV
2006
Springer
14 years 9 months ago
Database-Guided Simultaneous Multi-slice 3D Segmentation for Volumetric Data
Abstract. Automatic delineation of anatomical structures in 3-D volumetric data is a challenging task due to the complexity of the object appearance as well as the quantity of info...
Wei Hong, Bogdan Georgescu, Xiang Sean Zhou, Srira...
PRESENCE
2008
185views more  PRESENCE 2008»
13 years 7 months ago
Pilot Evaluation Study of a Virtual Paracentesis Simulator for Skill Training and Assessment: The Beneficial Effect of Haptic Di
Effective, real-time training of health care professionals in invasive procedures is a challenging task. Furthermore, assessing in practice the acquisition of the dexterity and sk...
Costas S. Tzafestas, Kostas Birbas, Yiannis Koumpo...
IWMM
2004
Springer
101views Hardware» more  IWMM 2004»
14 years 1 months ago
Exploring the barrier to entry: incremental generational garbage collection for Haskell
We document the design and implementation of a “production” incremental garbage collector for GHC 6.2. It builds on our earlier work (Non-stop Haskell) that exploited GHC’s ...
Andrew M. Cheadle, A. J. Field, Simon Marlow, Simo...