3533 search results - page 329 / 707 » Locally Optimized RANSAC |
161
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new...
206
click to vote
ISSS
1996
IEEE
15 years 11 months ago
1996
IEEE
An address generation and optimization environment (ADOPT) for distributed memory architectures, is presented. ADOPT is oriented to minimize the area overhead introduced by the us...
166
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
156
Voted
FLAIRS
2004
15 years 8 months ago
2004
In this paper we describe I-Subdue, an extension to the Subdue graph-based data mining system. I-Subdue operates over sequentially received relational data to incrementally discov...
154
click to vote
ESANN
2003
15 years 8 months ago
2003
This paper presents a novel vector quantizer (VQ) design algorithm for a burst error channel (BEC). The algorithm minimizes the average distortion when the BEC is in normal state o...