Sciweavers

2826 search results - page 403 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
SCAM
2006
IEEE
16 years 17 days ago
Stop-List Slicing
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...
Keith Gallagher, David Binkley, Mark Harman
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
TPDS
2002
136views more  TPDS 2002»
15 years 6 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
IJCNN
2007
IEEE
16 years 26 days ago
Spectral Clustering of Synchronous Spike Trains
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
António R. C. Paiva, Sudhir Rao, Il Park, J...
ICANN
2007
Springer
16 years 21 days ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...