17760 search results - page 278 / 3552 » A Generalization of the Massey-Ding Algorithm |
182
click to vote
NIPS
2008
15 years 8 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
258
click to vote
FIMI
2004
15 years 8 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
170
click to vote
APPINF
2003
15 years 8 months ago
2003
This paper presents an adaptive colour segmentation algorithm for Sony legged robots to play a football game. A Self-Organizing Map (SOM) is adopted to measure the current lightin...
152
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...
156
click to vote
AAAI
2000
15 years 8 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...