680 search results - page 62 / 136 » A randomized embedding algorithm for trees |
122
click to vote
ICANN
2010
Springer
15 years 1 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
145
click to vote
EMNLP
2011
14 years 1 months ago
2011
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...
143
click to vote
PODC
2004
ACM
15 years 6 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
152
click to vote
AML
2011
14 years 8 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
109
click to vote
ICIP
1995
IEEE
16 years 2 months ago
1995
IEEE
Recently a class of multiscale stochastic models has been introducedin which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a...