Sciweavers

3991 search results - page 113 / 799
» Bounding homogeneous models
Sort
View
CIE
2006
Springer
13 years 11 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
WSC
2007
13 years 10 months ago
Path-wise estimators and cross-path regressions: an application to evaluating portfolio strategies
Recently developed dual techniques allow us to evaluate a given sub-optimal dynamic portfolio policy by using the policy to construct an upper bound on the optimal value function....
Martin B. Haugh, Ashish Jain
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 8 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
CAV
2008
Springer
108views Hardware» more  CAV 2008»
13 years 10 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
ICASSP
2008
IEEE
14 years 2 months ago
Bounds and algorithms for time delay estimation on parallel, flat fading channels
We study time delay estimation (TDE) on parallel channels with flat fading. Several models for the channel gains are considered, and for each case we present the the maximum like...
Richard J. Kozick, Brian M. Sadler