1431 search results - page 111 / 287 » The complexity of random ordered structures |
STACS
2005
Springer
15 years 8 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
121
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
131
click to vote
ESWA
2008
15 years 3 months ago
2008
In this paper a novel complex classifier architecture is proposed. The architecture has a hierarchical tree-like structure with simple artificial neural networks (ANNs) at each no...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
141
click to vote
MCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...