Sciweavers

3735 search results - page 408 / 747
» Order compression schemes
Sort
View
FLAIRS
2000
15 years 8 months ago
Latin Hypercube Sampling in Bayesian Networks
Wepropose a schemefor producingLatin hypercube samples that can enhanceany of the existing sampling algorithms in Bayesiannetworks. Wetest this scheme in combinationwith the likel...
Jian Cheng, Marek J. Druzdzel
LFP
1994
113views more  LFP 1994»
15 years 8 months ago
Collecting More Garbage
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...
Pascal Fradet
ICASSP
2010
IEEE
15 years 7 months ago
Under-determined convolutive blind source separation using spatial covariance models
This paper deals with the problem of under-determined convolutive blind source separation. We model the contribution of each source to all mixture channels in the time-frequency d...
Ngoc Q. K. Duong, Emmanuel Vincent, Rémi Gr...
145
Voted
ICASSP
2010
IEEE
15 years 7 months ago
A union of incoherent spaces model for classification
We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data...
Karin Schnass, Pierre Vandergheynst
ANOR
2008
93views more  ANOR 2008»
15 years 7 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke