Sciweavers

6568 search results - page 129 / 1314
» Reducing the Complexity of Reductions
Sort
View
ICIP
2005
IEEE
16 years 8 months ago
Motion-compensation using variable-size block-matching with binary partition trees
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
Marc Servais, Theodore Vlachos, Thomas Davies
ICASSP
2009
IEEE
16 years 1 months ago
Identification of neurons participating in cell assemblies
Chances to detect assembly activity are expected to increase if the spiking activities of large numbers of neurons are recorded simultaneously. Although such massively parallel re...
Sonja Grün, Denise Berger, Christian Borgelt
ICMCS
2008
IEEE
119views Multimedia» more  ICMCS 2008»
16 years 28 days ago
Laplacian modeling of DCT coefficients for real-time encoding
Digital image/video coding standards such as JPEG, H.264 are becoming more and more important for multimedia applications. Due to the huge amount of computations, there are signif...
Jin Li, Moncef Gabbouj, Jarmo Takala, Hexin Chen
VTC
2008
IEEE
114views Communications» more  VTC 2008»
16 years 26 days ago
Iterative Correction of Clipped and Filtered Spatially Multiplexed OFDM Signals
— Peak-to-Average Power Ratio (PAPR) reduction in multicarrier systems with multiple transmit and receive antennas is considered. One attractive method for reducing the PAPR is t...
Steffen Bittner, Peter Zillmann, Gerhard Fettweis
MFCS
2007
Springer
16 years 18 days ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner