6365 search results - page 179 / 1273 » Fast Local Computation Algorithms |
122
click to vote
ANTS
2008
Springer
15 years 7 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
133
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
155
click to vote
DAC
1996
ACM
15 years 9 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
140
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
188
Voted
ACIVS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...