Sciweavers

2912 search results - page 464 / 583
» Logistic Model Trees
Sort
View
149
Voted
ENTCS
2006
134views more  ENTCS 2006»
15 years 3 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
152
Voted
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 3 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
113
Voted
JSYML
2008
63views more  JSYML 2008»
15 years 3 months ago
Classifying model-theoretic properties
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
Chris J. Conidis
147
Voted
CG
1998
Springer
15 years 3 months ago
Smooth transitions in texture-based simplification
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
Daniel G. Aliaga, Anselmo Lastra
117
Voted
TCS
2002
15 years 3 months ago
Associative language descriptions
The new Associative Language Description (ALD) model, a combination of locally testable and constituent structure ideas, is proposed, arguing that in practice it equals context-fr...
Alessandra Cherubini, Stefano Crespi-Reghizzi, Pie...