Sciweavers

1097 search results - page 30 / 220
» Boosting with incomplete information
Sort
View
90
Voted
CCS
2011
ACM
13 years 9 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
CIKM
2000
Springer
15 years 2 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
ASPLOS
1992
ACM
15 years 1 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
NCA
2007
IEEE
14 years 9 months ago
Handling of incomplete data sets using ICA and SOM in data mining
Based on independent component analysis (ICA) and self-organizing maps (SOM), this paper proposes an ISOM-DH model for the incomplete data’s handling in data mining. Under these ...
Hongyi Peng, Siming Zhu
IAT
2007
IEEE
15 years 4 months ago
Towards Constraint-Based Composition with Incomplete Service Descriptions
We apply our work on Web service discovery with initially incomplete information to the problem of service composition. Rich semantic descriptions of Goals and Web services allow ...
Matthew Moran, Tomas Vitvar, Maciej Zaremba