Sciweavers

1242 search results - page 129 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
NIPS
2000
14 years 11 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek
ICFP
2008
ACM
15 years 10 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
DIGRA
2005
Springer
15 years 3 months ago
A Cognitive Psychological Approach to Gameplay Emotions
Although emotions elicited by the fictional world or the artefact play a part in story-driven video games, they are certainly not the focus of the experience. From a cognitive psy...
Bernard Perron
COMPGEOM
2009
ACM
15 years 4 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
MST
2006
149views more  MST 2006»
14 years 10 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier