Sciweavers

318 search results - page 55 / 64
» Real Number Computability and Domain Theory
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
DATE
2009
IEEE
116views Hardware» more  DATE 2009»
14 years 2 months ago
An MDE methodology for the development of high-integrity real-time systems
—This paper reports on experience gained and lessons learned from an intensive investigation of model-driven engineering methodology and technology for application to high-integr...
Silvia Mazzini, Stefano Puri, Tullio Vardanega
SIGMOD
2009
ACM
125views Database» more  SIGMOD 2009»
14 years 7 months ago
Top-k queries on uncertain data: on score distribution and typical answers
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
Tingjian Ge, Stanley B. Zdonik, Samuel Madden
MOBIHOC
2008
ACM
14 years 7 months ago
Improving sensor network immunity under worm attacks: a software diversity approach
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
Yi Yang, Sencun Zhu, Guohong Cao
ATAL
2007
Springer
14 years 1 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...