Sciweavers

2168 search results - page 54 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
VTC
2008
IEEE
125views Communications» more  VTC 2008»
14 years 4 months ago
Wireless Broadband Services using Smart Caching
— Broadband access for all will be a key functionality in future mobile radio networks. Depending on the length and the characteristic of the radio wave propagation the performan...
Stephan Goebbels
ACL
2010
13 years 8 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa
ICIP
2010
IEEE
13 years 7 months ago
Position dependent linear intra prediction for image coding
Intra prediction has been efficiently employed in block based image/video coding to remove the spatial redundancy. In this paper, we propose a position dependent linear intra pred...
Li Zhang, Siwei Ma, Wen Gao
ICGA
2006
312views Optimization» more  ICGA 2006»
15 years 10 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 4 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio