Sciweavers

12825 search results - page 1957 / 2565
» Improved PLSOM algorithm
Sort
View
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 11 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
COMPGEOM
1994
ACM
15 years 11 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noisy BBOB-2010 testbed
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD . Recently, ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
KDD
2000
ACM
140views Data Mining» more  KDD 2000»
15 years 10 months ago
Effective Retrieval of Audio Information from Annotated Text Using Ontologies
To improve the accuracy in terms of precision and recall of an audio information retrieval system we have created a domainspecific ontology (a collection of key concepts and their...
Latifur Khan, Dennis McLeod
PLDI
1995
ACM
15 years 10 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove
« Prev « First page 1957 / 2565 Last » Next »