Sciweavers

985 search results - page 157 / 197
» Piercing Convex Sets
Sort
View
ACL
2006
13 years 9 months ago
Minimum Risk Annealing for Training Log-Linear Models
When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...
David A. Smith, Jason Eisner
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 7 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang
TCSV
2008
119views more  TCSV 2008»
13 years 7 months ago
Scalable Joint Source-Channel Coding for the Scalable Extension of H.264/AVC
This paper proposes a novel joint source-channel coding (JSCC) methodology which minimizes the end-to-end distortion for the transmission over packet loss channels of scalable vide...
Maryse R. Stoufs, Adrian Munteanu, Jan Cornelis, P...
JSAC
2007
104views more  JSAC 2007»
13 years 7 months ago
Tomlinson-Harashima Precoding for Broadcast Channels with Uncertainty
— 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 ...
Michael Botros Shenouda, Timothy N. Davidson
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...