Sciweavers

284 search results - page 25 / 57
» Sensitivity Analysis of the Result in Binary Decision Trees
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 6 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
DATE
2007
IEEE
102views Hardware» more  DATE 2007»
14 years 2 months ago
Use of statistical timing analysis on real designs
A vast literature has been published on Statistical Static Timing Analysis (SSTA), its motivations, its different implementations and their runtime/accuracy trade-offs. However, v...
A. Nardi, Emre Tuncer, S. Naidu, A. Antonau, S. Gr...
ATAL
2005
Springer
14 years 1 months ago
Extending the recognition-primed decision model to support human-agent collaboration
There has been much research investigating team cognition, naturalistic decision making, and collaborative technology as it relates to real world, complex domains of practice. How...
Xiaocong Fan, Shuang Sun, Michael D. McNeese, John...
MEDINFO
2007
132views Healthcare» more  MEDINFO 2007»
13 years 9 months ago
Comparing Decision Support Methodologies for Identifying Asthma Exacerbations
Objective: To apply and compare common machine learning techniques with an expert-built Bayesian Network to determine eligibility for asthma guidelines in pediatric emergency depa...
Judith W. Dexheimer, Laura E. Brown, Jeffrey Leego...