Sciweavers

515 search results - page 48 / 103
» A Reduced Complexity Algorithm for Minimizing N-Detect Tests
Sort
View
ICASSP
2011
IEEE
13 years 6 days ago
Using F0 to constrain the unit selection Viterbi network
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
Alistair Conkie, Ann K. Syrdal
EMSOFT
2010
Springer
13 years 6 months ago
Power-aware temporal isolation with variable-bandwidth servers
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...
Silviu S. Craciunas, Christoph M. Kirsch, Ana Soko...
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
ITNG
2007
IEEE
14 years 2 months ago
On Design and Analysis of a Feasible Network-on-Chip (NoC) Architecture
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
Jun Ho Bahn, Seung Eun Lee, Nader Bagherzadeh
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
14 years 1 months ago
A Genetic Approach for Gene Selection on Microarray Expression Data
Abstract. Microarrays allow simultaneous measurement of the expression levels of thousands of genes in cells under different physiological or disease states. Because the number of...
Yong-Hyuk Kim, Su-Yeon Lee, Byung Ro Moon