Sciweavers

1257 search results - page 227 / 252
» Simplifying spline models
Sort
View
98
Voted
APAL
2010
115views more  APAL 2010»
15 years 2 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
138
Voted
JCC
2006
110views more  JCC 2006»
15 years 2 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
112
Voted
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
15 years 2 months ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius
108
Voted
CVPR
2007
IEEE
16 years 4 months ago
Two thresholds are better than one
The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed ...
Tao Zhang, Terrance E. Boult, R. C. Johnson
226
Voted
POPL
2008
ACM
16 years 2 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman