Sciweavers

2446 search results - page 123 / 490
» Choiceless Polynomial Time
Sort
View
ICCV
2003
IEEE
16 years 2 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
RECOMB
2007
Springer
16 years 1 months ago
Rearrangements in Genomes with Centromeres Part I: Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromere...
Michal Ozery-Flato, Ron Shamir
118
Voted
VMCAI
2009
Springer
15 years 7 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
126
Voted
FOCS
2007
IEEE
15 years 7 months ago
Finding Disjoint Paths in Expanders Deterministically and Online
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
Noga Alon, Michael R. Capalbo
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 7 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...