Sciweavers

4095 search results - page 24 / 819
» How to test a tree
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
Redundant representation with complex wavelets: how to achieve sparsity
Overcomplete transforms, like the Dual-Tree Complex Wavelet Transform, offer more flexible signal representations than critically-sampled transforms, due to their properties of sh...
Nick G. Kingsbury, Tanya Reeves
ANTSW
2004
Springer
15 years 3 months ago
How to Use Ants for Hierarchical Clustering
Abstract. We present in this paper, a new model for document hierarchical clustering, which is inspired from the self-assembly behavior of real ants. We have simulated the way ants...
Hanene Azzag, Christiane Guinot, Gilles Venturini
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
14 years 11 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
IJFCS
2008
63views more  IJFCS 2008»
14 years 10 months ago
How to Synchronize the Activity of All Components of a P System?
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...
Francesco Bernardini, Marian Gheorghe, Maurice Mar...
JMLR
2010
104views more  JMLR 2010»
14 years 4 months ago
How to Explain Individual Classification Decisions
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...
David Baehrens, Timon Schroeter, Stefan Harmeling,...