Sciweavers

120 search results - page 4 / 24
» New completeness results for lazy conditional narrowing
Sort
View
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 7 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
SOFSEM
1998
Springer
13 years 11 months ago
Some Results on the Modelling of Spatial Data
Abstract. Formal methods based on the mathematical theory of partially ordered sets (i.e., posets) have been used in the database field for the modelling of spatial data since many...
Luca Forlizzi, Enrico Nardelli
BIRTHDAY
2006
Springer
13 years 11 months ago
Complete Categorical Deduction for Satisfaction as Injectivity
Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scientists by their elegance, simplicity and generality. The key factor leading to their generali...
Grigore Rosu
DAC
1994
ACM
13 years 11 months ago
Performance Analysis and Optimization of Schedules for Conditional and Loop-Intensive Specifications
This paper presents a new method,based on Markov chain analysis, to evaluate the performance of schedules of behavioral specifications. The proposed performance measure is the expe...
Subhrajit Bhattacharya, Sujit Dey, Franc Brglez
SIROCCO
2008
13 years 9 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau