Sciweavers

995 search results - page 44 / 199
» complexity 2011
Sort
View
149
Voted
IACR
2011
152views more  IACR 2011»
14 years 2 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
131
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Adaptive beam tracking for interference alignment in time-varying MIMO interference channels: Conjugate gradient approach
Based on a linear formulation to interference alignment, an adaptive algorithm for interference-aligning beam tracking in time-varying MIMO interference channels is proposed. It i...
Junse Lee, Heejung Yu, Youngchul Sung, Yong H. Lee
162
Voted
OL
2011
277views Neural Networks» more  OL 2011»
14 years 9 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
149
Voted
CVPR
2011
IEEE
14 years 10 months ago
FlowBoost - Appearance Learning from Sparsely Annotated Video
We propose a new learning method which exploits temporal consistency to successfully learn a complex appearance model from a sparsely labeled training video. Our approach consists...
Karim Ali, Francois Fleuret, David Hasler
108
Voted
TEDU
2011
163views Education» more  TEDU 2011»
14 years 9 months ago
Tangible Interfaces to Digital Connections, Centralized versus Decentralized
In the era of distributed digital media, technology is moving to the background and interoperability between devices increases. The handles for users to explore, make and break con...
Matthijs Kwak, Gerrit Niezen, Bram van der Vlist, ...