6365 search results - page 80 / 1273 » Fast Local Computation Algorithms |
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
148
click to vote
DAC
2012
ACM
13 years 4 months ago
2012
ACM
Improving detailed routing routability is an important objective of a global router. In this paper, we propose GDRouter, an interleaved global routing and detailed routing algorit...
108
click to vote
AI
1999
Springer
15 years 2 months ago
1999
Springer
Yeap [42] argued that an important basis for computing a cognitive map is the ability to compute and recognise local environments. Although he has demonstrated how such local envi...
128
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
ICPR
2000
IEEE
15 years 6 months ago
2000
IEEE