Sciweavers

943 search results - page 31 / 189
» How should data structures and algorithms be taught
Sort
View
KAIS
2007
75views more  KAIS 2007»
14 years 9 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
COMSNETS
2012
199views more  COMSNETS 2012»
13 years 5 months ago
Varanus: More-with-less fault localization in data centers
Abstract—Detecting and localizing performance faults is crucial for operating large enterprise data centers. This problem is relatively straightforward to solve if each entity (a...
Vaishali P. Sadaphal, Maitreya Natu, Harrick M. Vi...
ICCS
2005
Springer
15 years 3 months ago
Hierarchical Infrastructure for Large-Scale Distributed Privacy-Preserving Data Mining
Abstract. Data Mining is often required to be performed among a number of groups of sites, where the precondition is that no privacy of any site should be leaked out to other sites...
Jinlong Wang, Congfu Xu, Huifeng Shen, Yunhe Pan
ICDE
1996
IEEE
134views Database» more  ICDE 1996»
15 years 11 months ago
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments
Three pointer-based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. B...
Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prab...
CORR
2007
Springer
140views Education» more  CORR 2007»
14 years 9 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock