Sciweavers

162 search results - page 19 / 33
» Parallel frequent set counting
Sort
View
EUROPAR
2007
Springer
14 years 1 months ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou
ICCD
1999
IEEE
110views Hardware» more  ICCD 1999»
13 years 12 months ago
TriMedia CPU64 Architecture
We present a new VLIW core as a successor to the TriMedia TM1000. The processor is targeted for embedded use in media-processing devices like DTVs and set-top boxes. Intended as a...
Jos T. J. van Eijndhoven, Kees A. Vissers, Evert-J...
COLING
2010
13 years 2 months ago
Automated Translation of Semantic Relationships
We present a method for translating semantic relationships between languages where relationships are defined as pattern clusters. Given a pattern set which represents a semantic r...
Dmitry Davidov, Ari Rappoport
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 8 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
JMLR
2010
121views more  JMLR 2010»
13 years 2 months ago
Efficient Collapsed Gibbs Sampling for Latent Dirichlet Allocation
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...
Han Xiao, Thomas Stibor