905 search results - page 130 / 181 » On the Complexity of uSPR Distance |
170
Voted
AHS
2006
IEEE
15 years 8 months ago
2006
IEEE
Face recognition is a challenging field of research not only because of the complexity of this subject, but also because of its numerous practical applications. Much progress has ...
153
Voted
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
165
Voted
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
154
Voted
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
167
Voted
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...