Sciweavers

1452 search results - page 62 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
CVPR
2012
IEEE
12 years 12 days ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
IPPS
2007
IEEE
14 years 4 months ago
Formal Analysis for Debugging and Performance Optimization of MPI
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
Ganesh Gopalakrishnan, Robert M. Kirby
CVPR
2011
IEEE
13 years 1 months ago
Global Optimization for Optimal Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by estimating a reference shape and a set of rigid transformations gi...
Daniel Pizarro, Adrien Bartoli
COLING
2010
13 years 5 months ago
EMMA: A novel Evaluation Metric for Morphological Analysis
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
Sebastian Spiegler, Christian Monson
CORR
2011
Springer
115views Education» more  CORR 2011»
13 years 1 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...