1358 search results - page 64 / 272 » Mapping Accessibility Over Time |
142
click to vote
IJCNN
2000
IEEE
15 years 6 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
118
click to vote
SSDBM
2006
IEEE
15 years 8 months ago
2006
IEEE
Many applicationsstore data items for a pre-determined, finite length of time. Examples include slidingwindows over on-line data streams, where old data are dropped as the window...
154
click to vote
FAST
2011
14 years 6 months ago
2011
As file systems reach the petabytes scale, users and administrators are increasingly interested in acquiring highlevel analytical information for file management and analysis. T...
120
click to vote
PAMI
1998
15 years 2 months ago
1998
A new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is to rst extract a low-d...
120
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...