Sciweavers

417 search results - page 37 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
SIGIR
2011
ACM
12 years 11 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
ICIP
2000
IEEE
14 years 10 months ago
Inverse Filters for Reconstruction of Arbitrarily Focused Images from two Differently Focused Images
This paper describes a novel ltering method to reconstruct an arbitrarily focused image from two dierently focused images. Based on the assumption that image scene has two layers...
Akira Kubota, Kiyoharu Aizawa
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
14 years 2 months ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd
TCBB
2008
122views more  TCBB 2008»
13 years 8 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
14 years 2 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens