Sciweavers

3049 search results - page 428 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
SIGPRO
2008
107views more  SIGPRO 2008»
15 years 4 months ago
Exploiting geometry for improved hybrid AOA/TDOA-based localization
In this paper we examine the geometrically constrained optimization approach to localization with hybrid bearing (angle of arrival, AOA) and time difference of arrival (TDOA) sens...
Adrian N. Bishop, Baris Fidan, Kutluyil Dogancay, ...
TCOM
2010
197views more  TCOM 2010»
15 years 2 months ago
Power control for cooperative dynamic spectrum access networks with diverse QoS constraints
Dynamic spectrum access (DSA) is an integral part of cognitive radio technology aiming at efficient management of the available power and bandwidth resources. The present paper d...
Nikolaos Gatsis, Antonio G. Marqués, Georgi...
JMLR
2010
165views more  JMLR 2010»
14 years 11 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
IH
2009
Springer
15 years 11 months ago
Estimating Steganographic Fisher Information in Real Images
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
Andrew D. Ker
IWPEC
2009
Springer
15 years 11 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke