Sciweavers

6045 search results - page 178 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
SIAMCOMP
2000
66views more  SIAMCOMP 2000»
13 years 8 months ago
Computations of Uniform Recurrence Equations Using Minimal Memory Size
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...
Bruno Gaujal, Alain Jean-Marie, Jean Mairesse
NCA
2007
IEEE
13 years 7 months ago
A computational strategy exploiting genetic algorithms to recover color surface reflectance functions
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
Raimondo Schettini, Silvia Zuffi
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 7 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
13 years 6 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha
ECWEB
2009
Springer
204views ECommerce» more  ECWEB 2009»
14 years 2 months ago
Computational Complexity Reduction for Factorization-Based Collaborative Filtering Algorithms
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...
István Pilászy, Domonkos Tikk