147 search results - page 14 / 30 » The Computational Complexity of Quantified Reciprocals |
JSAC
2007
14 years 9 months ago
2007
— We consider the design of Tomlinson-Harashima (TH) precoders for broadcast channels in the presence of channel uncertainty. For systems in which uplink-downlink reciprocity is ...
106
click to vote
DBSEC
2008
14 years 10 months ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
69
Voted
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we present an algorithm which uses adaptive selection of low-level features for main subject detection. The algorithm first computes low-level features such as contr...
SIGGRAPH
1994
ACM
15 years 1 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
105
click to vote
JSSPP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Grids reliability remains an order of magnitude below clusters on production infrastructures. This work is aimsed at improving grid application performances by improving ...