Sciweavers

1435 search results - page 62 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
HUC
2010
Springer
14 years 10 months ago
Accuracy characterization of cell tower localization
Cell tower triangulation is a popular technique for determining the location of a mobile device. However, cell tower triangulation methods require the knowledge of the actual loca...
Jie Yang, Alexander Varshavsky, Hongbo Liu, Yingyi...
TWC
2008
137views more  TWC 2008»
14 years 9 months ago
Decoding, Performance Analysis, and Optimal Signal Designs for Coordinate Interleaved Orthogonal Designs
Space-time block codes (STBC) using coordinate interleaved orthogonal designs (CIOD) proposed recently by Khan and Rajan allow single-complex symbol decoding and offer higher data ...
Dung Ngoc Dao, Chintha Tellambura
TASLP
2008
120views more  TASLP 2008»
14 years 9 months ago
Rapid Speaker Adaptation Using Clustered Maximum-Likelihood Linear Basis With Sparse Training Data
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
Yun Tang, Richard Rose
LCTRTS
2007
Springer
15 years 3 months ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...