Sciweavers

630 search results - page 15 / 126
» Hardness results for approximating the bandwidth
Sort
View
77
Voted
TSD
2005
Springer
15 years 3 months ago
Why Is the Recognition of Spontaneous Speech so Hard?
Although speech, derived from reading texts, and similar types of speech, e.g. that from reading newspapers or that from news broadcast, can be recognized with high accuracy, recog...
Sadaoki Furui, Masanobu Nakamura, Tomohisa Ichiba,...
ICC
2009
IEEE
138views Communications» more  ICC 2009»
15 years 4 months ago
Iterative Detection and Decoding for Hard-Decision Forwarding Aided Cooperative Spatial Multiplexing
— In this paper, 1 the optimal decoding strategy for cooperative spatial multiplexing (CSM) aided systems is derived. In CSM systems, the multiple relay stations (RSs), which com...
Kyungchun Lee, Lajos Hanzo
FOCS
2009
IEEE
15 years 4 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
JACM
2006
99views more  JACM 2006»
14 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
INFOCOM
1998
IEEE
15 years 1 months ago
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
Santosh Paul Abraham, Anurag Kumar