Sciweavers

15073 search results - page 421 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
JMLR
2010
118views more  JMLR 2010»
15 years 1 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
ICPP
2009
IEEE
15 years 4 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
PARA
2004
Springer
16 years 7 days ago
Parallel Algorithms for Balanced Truncation Model Reduction of Sparse Systems
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...
José M. Badía, Peter Benner, Rafael ...
LPNMR
1997
Springer
15 years 11 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
CVPR
2006
IEEE
16 years 9 months ago
Object Pose Detection in Range Scan Data
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...
Jim Rodgers, Dragomir Anguelov, Hoi-Cheung Pang, D...