2638 search results - page 163 / 528 » Random Geometric Complexes |
168
click to vote
IPMI
2009
Springer
16 years 7 months ago
2009
Springer
The purpose of this paper is to measure the variability of a population of white matter fiber bundles without imposing unrealistic geometrical priors. In this respect, modeling fib...
173
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
175
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
156
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
160
click to vote
ICCSA
2004
Springer
15 years 11 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...