Sciweavers

165 search results - page 5 / 33
» Parallel Algorithm for Computing Reversal Distance
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 2 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
ISPDC
2005
IEEE
15 years 7 months ago
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
DAM
2007
120views more  DAM 2007»
15 years 1 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
EOR
2010
178views more  EOR 2010»
15 years 2 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
ICCV
2007
IEEE
16 years 3 months ago
Robust Visual Tracking Using the Time-Reversibility Constraint
Visual tracking is a very important front-end to many vision applications. We present a new framework for robust visual tracking in this paper. Instead of just looking forward in ...
Hao Wu, Rama Chellappa, Aswin C. Sankaranarayanan,...