Sciweavers

18306 search results - page 82 / 3662
» Algorithmics in Exponential Time
Sort
View
BCS
2008
14 years 11 months ago
Dynamic Neighbourhood Cellular Automata
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
Stefan S. Dantchev
JMLR
2010
99views more  JMLR 2010»
14 years 4 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
FOCS
1995
IEEE
15 years 1 months ago
Pseudorandom Generators, Measure Theory, and Natural Proofs
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
ICML
2007
IEEE
15 years 10 months ago
A permutation-augmented sampler for DP mixture models
We introduce a new inference algorithm for Dirichlet process mixture models. While Gibbs sampling and variational methods focus on local moves, the new algorithm makes more global...
Percy Liang, Michael I. Jordan, Benjamin Taskar
CORR
2010
Springer
77views Education» more  CORR 2010»
14 years 10 months ago
Triangular Decomposition of Semi-algebraic Systems
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
Changbo Chen, James H. Davenport, John P. May, Mar...