Sciweavers

96 search results - page 16 / 20
» Linearity, Non-determinism and Solvability
Sort
View
NECO
2006
98views more  NECO 2006»
13 years 7 months ago
Comment on "Characterization of Subthreshold Voltage Fluctuations in Neuronal Membranes, " by M. Rudolph and A. Destexhe
In two recent papers, Rudolph and Destexhe (Neural Comp. 15, 2577-2618, 2003; Neural Comp. in press, 2005) studied a leaky integrator model (i.e. an RC-circuit) driven by correlat...
Benjamin Lindner, André Longtin
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
SIAMAM
2000
131views more  SIAMAM 2000»
13 years 7 months ago
The Description of Homogeneous Branched-Chain Explosions with Slow Radical Recombination by Self-Adjusting Time Scales
A nonlinear multiscale technique is used to describe the time history of a spatially homogeneous chain-branching/chain-breaking explosion when chain branching is much faster than c...
Antonio L. Sanchez, Luis L. Bonilla, Manuel Carret...
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...