Sciweavers

1522 search results - page 271 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
AAAI
1998
14 years 11 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
86
Voted
DAGM
2010
Springer
14 years 10 months ago
Gaussian Mixture Modeling with Gaussian Process Latent Variable Models
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
Hannes Nickisch, Carl Edward Rasmussen
CCE
2008
14 years 9 months ago
Dynamic scheduling of multiproduct pipelines with multiple delivery due dates
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Mo...
Diego C. Cafaro, Jaime Cerdá
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 9 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
102
Voted
BMCBI
2006
203views more  BMCBI 2006»
14 years 9 months ago
Independent component analysis reveals new and biologically significant structures in micro array data
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
Attila Frigyesi, Srinivas Veerla, David Lindgren, ...