4850 search results - page 102 / 970 » Approximate Data Structures with Applications |
IISWC
2006
IEEE
15 years 4 months ago
2006
IEEE
Soft errors have become a significant concern and recent studies have measured the “architectural vulnerability factor” of systems to such errors, or conversely, the potentia...
133
click to vote
PAMI
2012
13 years 11 days ago
2012
Abstract—We propose a robust fitting framework, called Adaptive Kernel-Scale Weighted Hypotheses (AKSWH), to segment multiplestructure data even in the presence of a large number...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
GIS
1999
ACM
15 years 2 months ago
1999
ACM
Nowadays, many applications need data modeling facilities for the description of complex objects with spatial and/or temporal facilities. Responses to such requirements may be fou...
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...