172 search results - page 18 / 35 » Graph-Based Data Clustering with Overlaps |
DMDW
2000
15 years 1 months ago
2000
This paper describes a method for developing dimensional models from traditional Entity Relationship models. This can be used to design data warehouses and data marts based on ent...
ADC
2009
Springer
15 years 6 months ago
2009
Springer
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which dete...
AMDO
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents a new scheme for acquiring 3D kinematic structure and motion from time-series volume data, in particular, focusing on human body. Our basic strategy is to first...
CLUSTER
2007
IEEE
15 years 3 months ago
2007
IEEE
Bulk memory copies incur large overheads such as CPU stalling (i.e., no overlap of computation with memory copy operation), small register-size data movement, cache pollution, etc...
106
click to vote
EUSFLAT
2003
15 years 1 months ago
2003
In this paper, an architecture of a resourceallocating learning probabilistic neural network is considered. Construction and learning algorithms are proposed. The advantages of th...