5082 search results - page 824 / 1017 » Hierarchical Genetic Algorithms |
149
Voted
WEBI
2005
Springer
15 years 10 months ago
2005
Springer
Finding a set of web pages relevant to a user’s information goal is difficult due to the enormous size of the Internet. Search engines are able to find a set of pages that mat...
141
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
153
click to vote
SSPR
2004
Springer
15 years 10 months ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
145
click to vote
CVPR
2003
IEEE
15 years 10 months ago
2003
IEEE
A “graphics for vision” approach is proposed to address the problem of reconstruction from a large and imperfect data set: reconstruction on demand by tensor voting, or ROD-TV...
123
Voted
PADS
2003
ACM
15 years 10 months ago
2003
ACM
In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted....