Sciweavers

3415 search results - page 398 / 683
» Lower bounds on kernelization
Sort
View
STACS
2009
Springer
16 years 1 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay
ICASSP
2009
IEEE
16 years 1 months ago
A fast asymptotically efficient algorithm for blind separation of a linear mixture of block-wise stationary autoregressive proce
We propose a novel blind source separation algorithm called Block AutoRegressive Blind Identification (BARBI). The algorithm is asymptotically efficient in separation of instant...
Petr Tichavský, Arie Yeredor, Zbynek Koldov...
ICASSP
2009
IEEE
16 years 1 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
16 years 1 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
CSR
2009
Springer
16 years 1 months ago
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...
Kristoffer Arnsfelt Hansen