Sciweavers

9631 search results - page 144 / 1927
» The Costs of Using JXTA
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Unsupervised vocabulary discovery using non-negative matrix factorization with graph regularization
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
Meng Sun, Hugo Van hamme
ICASSP
2011
IEEE
14 years 10 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
GECCO
1999
Springer
15 years 10 months ago
Infrastructure Work Order Planning Using Genetic Algorithms
Infrastructure management offices plan and complete several thousand small construction projects annually. Effective planning is vital if the public and private sectors are to mai...
E. William East
WSC
2008
15 years 8 months ago
A dynamic crashing method for project management using simulation-based optimization
A dynamic simulation-based crashing method is introduced in this research to evaluate project networks and determine the optimum crashing configuration that minimizes the average ...
Michael E. Kuhl, Radhames A. Tolentino-Pena
MIA
2011
111views more  MIA 2011»
15 years 1 months ago
Segmenting the prostate and rectum in CT imagery using anatomical constraints
The automatic segmentation of the prostate and rectum from 3-D computed tomography (CT) images is still a challenging problem, and is critical for image-guided therapy application...
Siqi Chen, D. Michael Lovelock, Richard J. Radke