Sciweavers

598 search results - page 38 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Feature Preserving Image Smoothing Using a Continuous Mixture of Tensors
Many computer vision and image processing tasks require the preservation of local discontinuities, terminations and bifurcations. Denoising with feature preservation is a challeng...
Özlem N. Subakan, Bing Jian, Baba C. Vemuri, ...
ISMVL
2008
IEEE
102views Hardware» more  ISMVL 2008»
14 years 3 months ago
On the Data Structure Metrics of Quantum Multiple-Valued Decision Diagrams
This paper describes new metrics for the data structure referred to as quantum multiple-valued decision diagrams (QMDD) which are used to represent the matrices describing reversi...
David Y. Feinstein, Mitchell A. Thornton, D. Micha...
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
ICASSP
2011
IEEE
13 years 14 days ago
An optimization algorithm of independent mean and variance parameter tying structures for HMM-based speech synthesis
This paper proposes a technique for constructing independent parameter tying structures of mean and variance in HMMbased speech synthesis. Conventionally, mean and variance parame...
Shinji Takaki, Keiichiro Oura, Yoshihiko Nankaku, ...
NIPS
1998
13 years 10 months ago
Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
Michael S. Lewicki, Terrence J. Sejnowski