1599 search results - page 269 / 320 » Algorithms for Parity Games |
105
click to vote
BIBE
2008
IEEE
15 years 4 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
AFRIGRAPH
2009
ACM
15 years 1 months ago
2009
ACM
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...