Sciweavers

IWPEC
2010
Springer
13 years 2 months ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter
ISW
2010
Springer
13 years 2 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
ICIP
2010
IEEE
13 years 2 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
BMVC
2010
13 years 2 months ago
Large-scale Dictionary Learning For Local Coordinate Coding
Local coordinate coding has recently been introduced to learning visual feature dictionary and achieved top level performance for object recognition. However, the computational co...
Bo Xie, Mingli Song, Dacheng Tao
VTC
2010
IEEE
122views Communications» more  VTC 2010»
13 years 2 months ago
Generalized MIMO Transmit Preprocessing Using Pilot Symbol Assisted Rateless Codes
In this paper, we propose a generalized multiple-input multiple-output (MIMO) transmit preprocessing system, where both the channel coding and the linear MIMO transmit precoding c...
Nicholas Bonello, Du Yang, Shen Chen, Lajos Hanzo
TCOM
2010
112views more  TCOM 2010»
13 years 2 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
SIAMCO
2010
147views more  SIAMCO 2010»
13 years 2 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri
PPL
2010
118views more  PPL 2010»
13 years 2 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
JSAC
2010
131views more  JSAC 2010»
13 years 3 months ago
Joint synchronization and localization using TOAs: A linearization based WLS solution
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...
Shouhong Zhu, Zhiguo Ding
IJSI
2010
84views more  IJSI 2010»
13 years 3 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...