Sciweavers

654 search results - page 88 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
RECOMB
2006
Springer
15 years 10 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
ICML
2005
IEEE
15 years 10 months ago
Tempering for Bayesian C&RT
This paper concerns the experimental assessment of tempering as a technique for improving Bayesian inference for C&RT models. Full Bayesian inference requires the computation ...
Nicos Angelopoulos, James Cussens
CG
2006
Springer
14 years 9 months ago
Interruptible collision detection for deformable objects
This paper presents an approach to performing time-critical collision detection for deformable objects. The deformable objects are represented by dense meshes and their deformatio...
César Mendoza, Carol O'Sullivan
COMPGEOM
2004
ACM
15 years 3 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
CEC
2011
IEEE
13 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow