Sciweavers

522 search results - page 29 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
WG
2010
Springer
13 years 6 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
ICIP
2010
IEEE
13 years 5 months ago
Semi-supervised regression with temporal image sequences
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...
Ling Xie, Miguel Á. Carreira-Perpiñ&...
ICASSP
2011
IEEE
12 years 11 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
ICCAD
2009
IEEE
87views Hardware» more  ICCAD 2009»
13 years 5 months ago
Mitigation of intra-array SRAM variability using adaptive voltage architecture
SRAM cell design is driven by the need to satisfy static noise margin, write margin and read current margin (RCM) over all cells in the array in an energy-efficient manner. These ...
Ashish Kumar Singh, Ku He, Constantine Caramanis, ...
ICCS
2009
Springer
13 years 5 months ago
Bending Virtual Spring-Damper: A Solution to Improve Local Platoon Control
This article presents a local control approach to linear vehicle platooning. Linear platoon systems are sets of vehicles that use local or global perception capabilities to form a ...
Jean-Michel Contet, Franck Gechter, Pablo Gruer, A...