Sciweavers

2489 search results - page 287 / 498
» On the Subgroup Distance Problem
Sort
View
EMMCVPR
2007
Springer
15 years 8 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
GECCO
2010
Springer
214views Optimization» more  GECCO 2010»
15 years 8 months ago
Mixed-integer evolution strategy using multiobjective selection applied to warehouse design optimization
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
Edgar Reehuis, Thomas Bäck
AAAI
2008
15 years 6 months ago
Transfer Learning via Dimensionality Reduction
Transfer learning addresses the problem of how to utilize plenty of labeled data in a source domain to solve related but different problems in a target domain, even when the train...
Sinno Jialin Pan, James T. Kwok, Qiang Yang
ALGOSENSORS
2008
Springer
15 years 6 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
COMPGEOM
2008
ACM
15 years 6 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...