Sciweavers

179 search results - page 11 / 36
» Lazy Evaluation for OCL
Sort
View
116
Voted
AUSAI
2006
Springer
15 years 5 months ago
Lazy Learning for Improving Ranking of Decision Trees
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...
Han Liang, Yuhong Yan
100
Voted
UAI
2001
15 years 3 months ago
Solving Influence Diagrams using HUGIN, Shafer-Shenoy and Lazy Propagation
In this paper we present three different architectures for the evaluation of influence diagrams: HUGIN, Shafer-Shenoy (S-S), and Lazy Propagation (LP). HUGIN and LP are two new ar...
Anders L. Madsen, Dennis Nilsson
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 8 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
PEPM
2010
ACM
15 years 10 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
207
Voted
POPL
2007
ACM
16 years 2 months ago
Lazy multivariate higher-order forward-mode AD
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
Barak A. Pearlmutter, Jeffrey Mark Siskind