Sciweavers

2543 search results - page 270 / 509
» Optimal Ordered Problem Solver
Sort
View
CVPR
2010
IEEE
15 years 11 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
PR
2008
131views more  PR 2008»
15 years 3 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
15 years 8 months ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...
CSB
2003
IEEE
152views Bioinformatics» more  CSB 2003»
15 years 8 months ago
A Parallel Genetic Algorithm for Physical Mapping of Chromosomes
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
Suchendra M. Bhandarkar, Jinling Huang, Jonathan A...
HICSS
1999
IEEE
93views Biometrics» more  HICSS 1999»
15 years 7 months ago
The Design of a Letter-Mail Transportation Network by Intelligent Techniques
Many transportation providers such as package delivery companies and postal service organizations face the problem of designing a transportation network in order to service their ...
Hans-Jürgen Sebastian, Tore Grünert, Mic...