Sciweavers

2740 search results - page 204 / 548
» Approximating Component Selection
Sort
View
INFORMS
2008
241views more  INFORMS 2008»
15 years 3 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
JCO
2006
153views more  JCO 2006»
15 years 3 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
TCOM
2008
116views more  TCOM 2008»
15 years 3 months ago
Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
Chintha Tellambura
113
Voted
TNN
2010
173views Management» more  TNN 2010»
14 years 10 months ago
Multiclass relevance vector machines: sparsity and accuracy
Abstract--In this paper we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multi-class multi-kernel Relevance Vecto...
Ioannis Psorakis, Theodoros Damoulas, Mark A. Giro...
78
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Significance of vowel epenthesis in Telugu text-to-speech synthesis
Unit selection synthesis inventories have coverage issues, which lead to missing syllable or diphone units. In the conventional back-off strategy of substituting the missing unit ...
Vijayaditya Peddinti, Kishore Prahallad