Sciweavers

2924 search results - page 317 / 585
» Lower Bounds in Distributed Computing
Sort
View
ALT
2009
Springer
16 years 1 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...
ICASSP
2009
IEEE
15 years 11 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,...
FSTTCS
2009
Springer
15 years 11 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
WCNC
2008
IEEE
15 years 11 months ago
Estimation of Interference-Free Transmit Power for Opportunistic Spectrum Access
Abstract— We consider a scenario in which frequency agile radios opportunistically share a fixed spectrum resource with a set of primary nodes. We develop a collaborative scheme...
Brian L. Mark, Ahmed O. Nasif
ICC
2007
IEEE
15 years 10 months ago
Digital Code Tracking Loops Over Frequency-Selective Fading Channels
Abstract— The performance of a noncoherent digital delaylock loop (DDLL) with a RAKE scheme for direct-sequence spread-spectrum code division multiple access (DS/SS-CDMA) signals...
Tsan-Ming Wu, Tsung-Hua Tsai