Sciweavers

563 search results - page 41 / 113
» Computing approximate PSD factorizations
Sort
View
DAGM
2009
Springer
13 years 11 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
ICML
2010
IEEE
13 years 11 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 5 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
IPPS
2006
IEEE
14 years 4 months ago
On the performance of parallel normalized explicit preconditioned conjugate gradient type methods
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
George A. Gravvanis, Konstantinos M. Giannoutakis
IADIS
2004
13 years 11 months ago
A first approximation to estimate the usability of a software application task
Our objective is to obtain the level of usability of a software application over the different tasks for which it has been developed. Nowadays, usability is measured through diffe...
M. González Aparicio, José Antonio L...