Sciweavers

3471 search results - page 456 / 695
» Obstacle Numbers of Graphs
Sort
View
CVPR
2010
IEEE
16 years 24 days ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
16 years 24 days ago
Towards clustering with XCS
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
Kreangsak Tamee, Larry Bull, Ouen Pinngern
SOFSEM
2007
Springer
16 years 22 days ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
16 years 5 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
DAGM
2004
Springer
16 years 21 hour ago
Predictive Discretization During Model Selection
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
Harald Steck, Tommi Jaakkola