Sciweavers

299 search results - page 27 / 60
» Dispositional implementation solves the superfluous structur...
Sort
View
ICPR
2006
IEEE
14 years 9 months ago
A Unified Formulation of Invariant Point Pattern Matching
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
Terry Caelli, Tibério S. Caetano
ISCA
2012
IEEE
279views Hardware» more  ISCA 2012»
11 years 11 months ago
Staged memory scheduling: Achieving high performance and scalability in heterogeneous systems
When multiple processor (CPU) cores and a GPU integrated together on the same chip share the off-chip main memory, requests from the GPU can heavily interfere with requests from t...
Rachata Ausavarungnirun, Kevin Kai-Wei Chang, Lava...
MICCAI
2004
Springer
14 years 9 months ago
Coupling Statistical Segmentation and PCA Shape Modeling
This paper presents a novel segmentation approach featuring shape constraints of multiple structures. A framework is developed combining statistical shape modeling with a maximum a...
Kilian M. Pohl, Simon K. Warfield, Ron Kikinis, W....
AMC
2010
175views more  AMC 2010»
13 years 8 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu
AAAI
2007
13 years 10 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein