4536 search results - page 402 / 908 » Contention-Sensitive Data Structures and Algorithms |
191
click to vote
PKDD
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
153
Voted
ICDM
2006
IEEE
16 years 27 days ago
2006
IEEE
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
153
click to vote
GFKL
2005
Springer
16 years 12 days ago
2005
Springer
Projection pursuit was originally introduced to identify structures in multivariate data clouds (Huber, 1985). The idea of projecting data to a lowdimensional subspace can also be ...
182
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Dimensionality reduction is among the keys in mining highdimensional data. This paper studies semi-supervised dimensionality reduction. In this setting, besides abundant unlabeled...
173
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...