Sciweavers

35419 search results - page 173 / 7084
» How are we doing
Sort
View
ICML
2006
IEEE
16 years 5 months ago
How boosting the margin can also boost classifier complexity
Boosting methods are known not to usually overfit training data even as the size of the generated classifiers becomes large. Schapire et al. attempted to explain this phenomenon i...
Lev Reyzin, Robert E. Schapire
ALT
2002
Springer
16 years 1 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
122
Voted
ACIIDS
2009
IEEE
122views Database» more  ACIIDS 2009»
15 years 11 months ago
How to Maximize User Satisfaction Degree in Multi-service IP Networks
—Bandwidth allocation is a fundamental problem in communication networks. With current network moving towards the Future Internet model, the problem is further intensified as net...
Huy Anh Nguyen, Tam Van Nguyen, Deokjai Choi
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen
COLCOM
2008
IEEE
15 years 10 months ago
Collaborative Search and User Privacy: How Can They Be Reconciled?
Abstract. Collaborative search engines (CSE) let users pool their resources and share their experiences when seeking information on the web. However, when shared, search terms and ...
Thorben Burghardt, Erik Buchmann, Klemens Böh...