765 search results - page 70 / 153 » Empirical Design of Geometric Algorithms |
131
click to vote
TVCG
2011
14 years 6 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
100
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
ACCV
2006
Springer
15 years 5 months ago
2006
Springer
The need for empirical evaluation metrics and algorithms is well acknowledged in the field of computer vision. The process leads to precise insights to understanding current techn...
CASCON
1992
15 years 1 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
102
click to vote
DAC
2004
ACM
16 years 25 days ago
2004
ACM
Long design cycles due to the inability to predict silicon realities is a well-known problem that plagues analog/RF integrated circuit product development. As this problem worsens...