Sciweavers

25 search results - page 4 / 5
» Segmentations with Rearrangements
Sort
View
CVPR
2006
IEEE
14 years 11 months ago
Acceleration Strategies for Gaussian Mean-Shift Image Segmentation
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...
Miguel Á. Carreira-Perpiñán
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 10 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
RECOMB
2004
Springer
14 years 9 months ago
The Distribution of Inversion Lengths in Bacteria
The distribution of the lengths of genomic segments inverte during the evolutionary divergence of two species cannot be inferred d rectly from the output of genome rearrangement al...
Adrian Maler, David Sankoff, Elisabeth R. M. Tilli...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
14 years 20 days ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
CVPR
2011
IEEE
13 years 24 days ago
A fully automated greedy square jigsaw puzzle solver
In the square jigsaw puzzle problem one is required to reconstruct the complete image from a set of non-overlapping, unordered, square puzzle parts. Here we propose a fully automa...
Dolev Pomeranz, Michal Shemesh, Ohad Ben-Shahar