Sciweavers

1244 search results - page 32 / 249
» Searching in Higher Dimension
Sort
View
DCG
2008
86views more  DCG 2008»
13 years 10 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
ICDE
2007
IEEE
116views Database» more  ICDE 2007»
14 years 11 months ago
MultiMap: Preserving disk locality for multidimensional datasets
MultiMap is an algorithm for mapping multidimensional datasets so as to preserve the data's spatial locality on disks. Without revealing disk-specific details to applications...
Minglong Shao, Steven W. Schlosser, Stratos Papado...
GECCO
2004
Springer
14 years 3 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
14 years 2 months ago
Benchmarking the NEWUOA on the BBOB-2009 function testbed
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
Raymond Ros
ERCIMDL
1997
Springer
169views Education» more  ERCIMDL 1997»
14 years 2 months ago
Relevance Feedback and Query Expansion for Searching the Web: A Model for Searching a Digital Library
: A fully operational large scale digital library is likely to be based on a distributed architecture and because of this it is likely that a number of independent search engines m...
Alan F. Smeaton, Francis Crimmins