Sciweavers

413 search results - page 25 / 83
» On space constrained set selection problems
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
14 years 1 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
FGCS
2000
81views more  FGCS 2000»
13 years 7 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
ICDM
2010
IEEE
228views Data Mining» more  ICDM 2010»
13 years 5 months ago
Multi-label Feature Selection for Graph Classification
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
Xiangnan Kong, Philip S. Yu
EC
2008
175views ECommerce» more  EC 2008»
13 years 7 months ago
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Nondominated Neighbor Immune Algorithm (NNIA) is proposed for multiobjective optimization by using a novel nondominated neighbor-based selection technique, an immune inspired oper...
Maoguo Gong, Licheng Jiao, Haifeng Du, Liefeng Bo