4539 search results - page 193 / 908 » Approaches to Compute Workflow Complexity |
150
click to vote
SCALESPACE
2005
Springer
15 years 10 months 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 ...
150
click to vote
WCC
2005
Springer
15 years 10 months 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...
141
click to vote
ICIP
2003
IEEE
15 years 9 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...
147
click to vote
SSDBM
2003
IEEE
15 years 9 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
119
click to vote
FCCM
1998
IEEE
15 years 8 months ago
1998
IEEE
PAM-Blox are object-oriented circuit generators on top of the PCI Pamette design environment, PamDC. High- performance FPGA design for adaptive computing is simplified by using a ...