Sciweavers

362 search results - page 35 / 73
» A Theory of Probabilistic Functional Testing
Sort
View
AUSAI
2005
Springer
15 years 5 months ago
Neighborhood Re-structuring in Particle Swarm Optimization
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...
BMCBI
2010
110views more  BMCBI 2010»
14 years 12 months ago
TimeDelay-ARACNE: Reverse engineering of gene networks from time-course data by an information theoretic approach
Background: One of main aims of Molecular Biology is the gain of knowledge about how molecular components interact each other and to understand gene function regulations. Using mi...
Pietro Zoppoli, Sandro Morganella, Michele Ceccare...
ICASSP
2008
IEEE
15 years 6 months ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman
CIE
2008
Springer
15 years 1 months ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova