Sciweavers

662 search results - page 19 / 133
» Cheap and Fast - But is it Good
Sort
View
EOR
2008
107views more  EOR 2008»
13 years 7 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
ICASSP
2011
IEEE
12 years 11 months ago
Fast single image fog removal using edge-preserving smoothing
Imaging in poor weather is often severely degraded by scattering due to suspended particles in the atmosphere such as haze and fog. In this paper, we propose a novel fast defoggin...
Jing Yu, Qingmin Liao
CORR
2012
Springer
185views Education» more  CORR 2012»
12 years 3 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
ICASSP
2009
IEEE
14 years 2 months ago
Spoken term detection using fast phonetic decoding
While spoken term detection (STD) systems based on word indices provide good accuracy, there are several practical applications where it is infeasible or too costly to employ an L...
Roy Wallace, Robbie Vogt, Sridha Sridharan
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
14 years 1 months ago
FEMA: A Fast Expectation Maximization Algorithm based on Grid and PCA
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
Zhiwen Yu, Hau-San Wong