417 search results - page 7 / 84 » Some Theory for Generalized Boosting Algorithms |
SIGIR
2003
ACM
14 years 29 days ago
2003
ACM
Term-based representations of documents have found widespread use in information retrieval. However, one of the main shortcomings of such methods is that they largely disregard le...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
ICAI
2008
13 years 9 months ago
2008
Intrusion detection is an active research field in the development of reliable web-based information systems, where many artificial intelligence techniques are exploited to fit th...