Sciweavers

10792 search results - page 106 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
CVPR
2012
IEEE
13 years 1 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
HEURISTICS
1998
252views more  HEURISTICS 1998»
14 years 10 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
JUCS
2002
131views more  JUCS 2002»
14 years 10 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
IJPP
2008
158views more  IJPP 2008»
14 years 10 months ago
The ParTriCluster Algorithm for Gene Expression Analysis
Analyzing gene expression patterns is becoming a highly relevant task in the Bioinformatics area. This analysis makes it possible to determine the behavior patterns of genes under...
Renata Braga Araújo, Guilherme Henrique Tri...
IJAR
2010
75views more  IJAR 2010»
14 years 9 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...