2370 search results - page 146 / 474 » The Characterization of Data-Accumulating Algorithms |
SAC
2004
ACM
15 years 3 months ago
2004
ACM
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
SMA
2003
ACM
15 years 3 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
COCO
1990
Springer
15 years 2 months ago
1990
Springer
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
EURONGI
2006
Springer
15 years 1 months ago
2006
Springer
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic...
IWMM
2000
Springer
15 years 1 months ago
2000
Springer
We study the effectiveness of garbage collection (GC) algorithms by measuring the time difference between the actual collection time of an object and the potential earliest collec...