Sciweavers

103 search results - page 15 / 21
» Algorithms for solving linear systems over cyclotomic fields
Sort
View
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
25
Voted
MICCAI
2010
Springer
13 years 5 months ago
Symmetric Positive-Definite Cartesian Tensor Orientation Distribution Functions (CT-ODF)
Abstract. A novel method for estimating a field of orientation distribution functions (ODF) from a given set of DW-MR images is presented. We model the ODF by Cartesian tensor basi...
Yonas T. Weldeselassie, Angelos Barmpoutis, M. Ste...
AIPS
2008
13 years 9 months ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
ARC
2010
Springer
387views Hardware» more  ARC 2010»
14 years 2 months ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...