Sciweavers

134 search results - page 24 / 27
» Error Thresholds and Their Relation to Optimal Mutation Rate...
Sort
View
TIT
2008
92views more  TIT 2008»
13 years 7 months ago
Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem
Abstract--We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0 : PXY against H1 : PXPY ...
Chao Tian, Jun Chen
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 7 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
ICASSP
2011
IEEE
12 years 11 months ago
Application specific loss minimization using gradient boosting
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
Bin Zhang, Abhinav Sethy, Tara N. Sainath, Bhuvana...
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 19 days ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
ICASSP
2010
IEEE
13 years 7 months ago
Semantic confidence calibration for spoken dialog applications
The success of spoken dialog applications depends strongly on the quality of the semantic confidence measure that determines the selection of the dialog strategy. However, the sem...
Dong Yu, Li Deng