Sciweavers

257 search results - page 6 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
SAC
2005
ACM
14 years 1 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
SI3D
2006
ACM
14 years 1 months ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
14 years 1 months ago
A Computational Framework for Taxonomic Research: Diagnosing Body Shape within Fish Species Complexes
It is estimated that ninety percent of the world’s species have yet to be discovered and described. The main reason for the slow pace of new species description is that the scie...
Yixin Chen, Henry L. Bart Jr., Shuqing Huang, Huim...
ICASSP
2011
IEEE
12 years 11 months 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
ICPR
2000
IEEE
14 years 8 months ago
A Markov Random Field Model for Automatic Speech Recognition
Speech can be represented as a time/frequency distribution of energy using a multi-band filter bank. A Markov random field model, which takes into account the possible time asynch...
Gérard Chollet, Guillaume Gravier, Marc Sig...