Sciweavers

435 search results - page 68 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
INTERSPEECH
2010
14 years 4 months ago
Unsupervised discovery and training of maximally dissimilar cluster models
One of the difficult problems of acoustic modeling for Automatic Speech Recognition (ASR) is how to adequately model the wide variety of acoustic conditions which may be present i...
Françoise Beaufays, Vincent Vanhoucke, Bria...
TII
2010
113views Education» more  TII 2010»
14 years 4 months ago
An Automated Framework for Formal Verification of Timed Continuous Petri Nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
Marius Kloetzer, Cristian Mahulea, Calin Belta, Ma...
TSMC
2010
14 years 4 months ago
Particle Swarm Optimization With Composite Particles in Dynamic Environments
In recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with c...
Lili Liu, Shengxiang Yang, Dingwei Wang
BIOINFORMATICS
2011
14 years 1 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
15 years 10 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...