Sciweavers

2969 search results - page 45 / 594
» A space efficient algorithm for group structure computation
Sort
View
CVPR
2011
IEEE
14 years 11 months ago
Non-Rigid Structure from Motion with Complementary Rank-3 Spaces
Non-rigid structure from motion (NR-SFM) is a difficult, underconstrained problem in computer vision. This paper proposes a new algorithm that revises the standard matrix factori...
Paulo Gotardo, Aleix Martinez
IPPS
2010
IEEE
15 years 29 days ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
15 years 7 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
IJDMB
2010
128views more  IJDMB 2010»
15 years 10 days ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
ICPR
2002
IEEE
16 years 4 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang