Sciweavers

1142 search results - page 122 / 229
» Approximability of Clausal Constraints
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...
ICIP
2000
IEEE
16 years 8 months ago
An Information-Theoretic Model for Image Watermarking and Data Hiding
An information?theoretic model for image watermarking and data hiding systems is presented in this paper. The fundamental capacity limits of these systems are determined by the st...
Gen-Iu. Lin, Mehmet Kivanç Mihçak, P...
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 6 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
ICASSP
2009
IEEE
16 years 1 months ago
Distributed peer-to-peer beamforming for multiuser relay networks
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
GLOBECOM
2006
IEEE
16 years 14 days ago
Power Optimal Opportunistic Scheduling
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...