14774 search results - page 351 / 2955 » Computational complexity and evolutionary computation |
145
click to vote
ICDT
2005
ACM
16 years 5 days ago
2005
ACM
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
176
click to vote
ISSAC
2005
Springer
16 years 5 days ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
183
click to vote
SCALESPACE
2005
Springer
16 years 4 days ago
2005
Springer
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...
189
click to vote
WCC
2005
Springer
16 years 4 days ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
184
click to vote
ICIP
2003
IEEE
15 years 12 months ago
2003
IEEE
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...