Sciweavers

6045 search results - page 195 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
GD
2004
Springer
14 years 1 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
ICIP
2003
IEEE
14 years 1 months ago
K-Voronoi diagrams computing in arbitrary domains
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...
Rubén Cárdenes, Simon K. Warfield, A...
CAIP
2003
Springer
244views Image Analysis» more  CAIP 2003»
14 years 1 months ago
Real-Time Optic Flow Computation with Variational Methods
Abstract. Variational methods for optic flow computation have the reputation of producing good results at the expense of being too slow for real-time applications. We show that re...
Andrés Bruhn, Joachim Weickert, Christian F...
HCW
1999
IEEE
14 years 16 days ago
Multiple Cost Optimization for Task Assignment in Heterogeneous Computing Systems Using Learning Automata
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
Raju D. Venkataramana, N. Ranganathan
CVPR
2010
IEEE
13 years 6 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel