Sciweavers

2173 search results - page 370 / 435
» On the Values of Reducibility Candidates
Sort
View
ICML
1999
IEEE
16 years 7 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
WWW
2007
ACM
16 years 6 months ago
Speeding up adaptation of web service compositions using expiration times
Web processes must often operate in volatile environments where the quality of service parameters of the participating service providers change during the life time of the process...
John Harney, Prashant Doshi
WWW
2005
ACM
16 years 6 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
VLSID
2002
IEEE
99views VLSI» more  VLSID 2002»
16 years 6 months ago
Input Space Adaptive Embedded Software Synthesis
This paper presents a novel technique, called input space adaptive software synthesis, for the energy and performance optimization of embedded software. The proposed technique is ...
Weidong Wang, Anand Raghunathan, Ganesh Lakshminar...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
16 years 6 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...