7228 search results - page 549 / 1446 » From Algorithmic to Subjective Randomness |
196
click to vote
ICANN
2010
Springer
15 years 7 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...
225
click to vote
HICSS
2008
IEEE
15 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
196
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
179
click to vote
IJISTA
2008
15 years 7 months ago
2008
Abstract: Technologies for measuring range data were intensively developed in recent years. The time-of-flight matrix range sensor is one of the most active range acquisition devic...
174
click to vote
COR
2007
15 years 7 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...