Papers published on a yearly basis
Papers
More filters
19 Apr 1999
TL;DR: A resurrecting duckling security policy model is presented, which describes secure transient association of a device with multiple serialised owners over the air in a short range wireless channel.
Abstract: In the near future, many personal electronic devices will be able to communicate with each other over a short range wireless channel. We investigate the principal security issues for such an environment. Our discussion is based on the concrete example of a thermometer that makes its readings available to other nodes over the air. Some lessons learned from this example appear to be quite general to ad-hoc networks, and rather different from what we have come to expect in more conventional systems: denial of service, the goals of authentication, and the problems of naming all need re-examination. We present the resurrecting duckling security policy model, which describes secure transient association of a device with multiple serialised owners.
1,355 citations
Proceedings Article•
31 Jul 1999TL;DR: The boosting algorithm AdaBoost is introduced, and the underlying theory of boosting is explained, including an explanation of why boosting often does not suffer from overfitting.
Abstract: Boosting is a general method for improving the accuracy of any given learning algorithm. This short paper introduces the boosting algorithm AdaBoost, and explains the underlying theory of boosting, including an explanation of why boosting often does not suffer from overfitting. Some examples of recent applications of boosting are also described.
1,339 citations
TL;DR: Two approaches to build integer to integer wavelet transforms are presented and the precoder of Laroiaet al., used in information transmission, is adapted and combined with expansion factors for the high and low pass band in subband filtering.
1,269 citations
TL;DR: A package of practical tools and libraries for manipulating graphs and their drawings that includes stream and event interfaces for graph operations, high-quality static and dynamic layout algorithms, and the ability to handle sizable graphs is described.
Abstract: SUMMARY We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, high-quality static and dynamic layout algorithms, and the ability to handle sizable graphs. We conclude with a description of the applications of this package to a variety of software engineering tools. Copyright c 1999 John Wiley & Sons, Ltd.
1,237 citations
TL;DR: It is shown that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the number of queries, and this exponential decrease holds for query learning of perceptrons.
Abstract: We analyze the “query by committee” algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the number of queries. We show that, in particular, this exponential decrease holds for query learning of perceptrons.
1,234 citations
Authors
Showing all 1881 results
| Name | H-index | Papers | Citations |
|---|---|---|---|
| Yoshua Bengio | 202 | 1033 | 420313 |
| Scott Shenker | 150 | 454 | 118017 |
| Paul Shala Henry | 137 | 318 | 35971 |
| Peter Stone | 130 | 1229 | 79713 |
| Yann LeCun | 121 | 369 | 171211 |
| Louis E. Brus | 113 | 347 | 63052 |
| Jennifer Rexford | 102 | 394 | 45277 |
| Andreas F. Molisch | 96 | 777 | 47530 |
| Vern Paxson | 93 | 267 | 48382 |
| Lorrie Faith Cranor | 92 | 326 | 28728 |
| Ward Whitt | 89 | 424 | 29938 |
| Lawrence R. Rabiner | 88 | 378 | 70445 |
| Thomas E. Graedel | 86 | 348 | 27860 |
| William W. Cohen | 85 | 384 | 31495 |
| Michael K. Reiter | 84 | 380 | 30267 |