Sciweavers

17298 search results - page 3159 / 3460
» Abstract computing machines
Sort
View
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
15 years 4 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
TASLP
2008
120views more  TASLP 2008»
15 years 4 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
TCAD
2008
102views more  TCAD 2008»
15 years 4 months ago
Quantum Circuit Simplification and Level Compaction
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...
TCAD
2008
106views more  TCAD 2008»
15 years 4 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
TCOM
2008
151views more  TCOM 2008»
15 years 4 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
« Prev « First page 3159 / 3460 Last » Next »