Sciweavers

3735 search results - page 115 / 747
» Order compression schemes
Sort
View
ECAI
2006
Springer
15 years 8 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
CORR
2004
Springer
125views Education» more  CORR 2004»
15 years 4 months ago
High-Level Networking With Mobile Code And First Order AND-Continuations
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
Paul Tarau, Verónica Dahl
SIAMNUM
2010
105views more  SIAMNUM 2010»
14 years 11 months ago
Quantization Based Filtering Method Using First Order Approximation
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
Afef Sellami
ICIP
2006
IEEE
16 years 6 months ago
A Multi-Terminal Model-Based Video Compression Algorithm
We present a novel 3D model-based distributed video coding algorithm. It is based on independent, model-based tracking of multiple sources and distributed coding of the tracked fe...
Bi Song, Amit K. Roy Chowdhury, Ertem Tuncel
ICPP
2008
IEEE
15 years 11 months ago
Improving the Performance of Multithreaded Sparse Matrix-Vector Multiplication Using Index and Value Compression
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
Kornilios Kourtis, Georgios I. Goumas, Nectarios K...