Sciweavers

6142 search results - page 33 / 1229
» The Complexity of Partition Functions
Sort
View
GLOBECOM
2006
IEEE
15 years 3 months ago
Bayesian Data Fusion for Asynchronous DS-CDMA Sensor Networks in Rayleigh Fading
Abstract— In this paper, we propose asynchronous non-orthogonal communication between distributed sensors and a data fusion center via asynchronous direct-sequence code-division ...
Justin S. Dyer, Balasubramaniam Natarajan, Sudharm...
ICIP
2008
IEEE
15 years 11 months ago
A near optimal coder for image geometry with adaptive partitioning
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
Arian Maleki, Morteza Shahram, Gunnar Carlsson
ICIP
2006
IEEE
15 years 11 months ago
Low Complexity Inter-Mode Selection for H.264
The coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitio...
Seydou-Nourou Ba, Yucel Altunbasak, Hasan F. Ates
ISPDC
2007
IEEE
15 years 4 months ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky
67
Voted
IJCAI
2001
14 years 11 months ago
Solving Factored MDPs via Non-Homogeneous Partitioning
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
Kee-Eung Kim, Thomas Dean