Sciweavers

796 search results - page 78 / 160
» Approximating the centroid is hard
Sort
View
PERCOM
2006
ACM
14 years 7 months ago
Maximum Weighted Matching with Interference Constraints
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
ASIACRYPT
2009
Springer
14 years 2 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
ICC
2008
IEEE
114views Communications» more  ICC 2008»
14 years 2 months ago
Iterative DA/DD Channel Estimation for KSP-OFDM
—In this paper, we propose an iterative joint DA/DD channel estimation algorithm for known symbol padding (KSP) OFDM. The pilot symbols used to estimate the channel are not only ...
Dieter Van Welden, Heidi Steendam, Marc Moeneclaey
FOCS
2005
IEEE
14 years 1 months ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx
CODES
1998
IEEE
14 years 3 hour ago
Software timing analysis using HW/SW cosimulation and instruction set simulator
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
Jie Liu, Marcello Lajolo, Alberto L. Sangiovanni-V...