2376 search results - page 90 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
139
click to vote
CN
1998
15 years 3 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
124
Voted
IPL
2002
15 years 3 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
158
Voted
TWC
2010
14 years 10 months ago
2010
Wideband source localization using acoustic sensor networks has been drawing a lot of research interest recently in wireless communication applications, such as cellular handset lo...
139
Voted
COLT
1998
Springer
15 years 7 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
125
Voted
PODS
2001
ACM
16 years 3 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...