Sciweavers

813 search results - page 50 / 163
» desire 2010
Sort
View
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
PERCOM
2010
ACM
13 years 5 months ago
Privacy-preserving admission to mobile peer-to-peer groups
Mobile peer-to-peer groups, which do not require any pre-deployed infrastructure or trusted centralized authority are valuable for a variety of collaborative applications. This wor...
Mark Manulis
PIMRC
2010
IEEE
13 years 5 months ago
On the detection probability of parallel code phase search algorithms in GPS receivers
The first stage of the signal processing chain in a Global Positioning System (GPS) receiver is the acquisition, which provides for a desired satellite coarse code phase and Dopple...
Bernhard Geiger, Michael Soudan, Christian Vogel
PIMRC
2010
IEEE
13 years 5 months ago
Transmission of common, public and confidential messages in broadcast channels with multiple antennas
Abstract-- We study the Gaussian multiple-input multipleoutput (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the...
Ersen Ekrem, Sennur Ulukus
CLEIEJ
2010
13 years 5 months ago
Synchronous versus Asynchronous interaction between users of two collaborative tools for the production of Use Cases
The performance of requirement engineers in the production of Use Cases is analyzed and compared using a collaborative editor in synchronous mode versus one in asynchronous mode, ...
Carlos M. Fuenzalida, Hector B. Antillanca