Sciweavers

2189 search results - page 230 / 438
» A Graded Applicability of Rules
Sort
View
UAI
1998
13 years 11 months ago
Learning the Structure of Dynamic Probabilistic Networks
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
Nir Friedman, Kevin P. Murphy, Stuart J. Russell
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 9 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
LISP
2008
104views more  LISP 2008»
13 years 9 months ago
On the implementation of automatic differentiation tools
Automatic differentiation is a semantic transformation that applies the rules of differential calculus to source code. It thus transforms a computer program that computes a mathema...
Christian H. Bischof, Paul D. Hovland, Boyana Norr...
ENTCS
2007
108views more  ENTCS 2007»
13 years 9 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig
CVGIP
2002
104views more  CVGIP 2002»
13 years 9 months ago
Sharp Features on Multiresolution Subdivision Surfaces
In this paper we describe a method for creating sharp features and trim regions on multiresolution subdivision surfaces along a set of user-defined curves. Operations such as engr...
Henning Biermann, Ioana M. Martin, Denis Zorin, Fa...