835 search results - page 47 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
92
Voted
AAAI
2007
15 years 2 months ago
2007
Online mechanism design considers the problem of sequential decision making in a multi-agent system with self-interested agents. The agent population is dynamic and each agent has...
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
112
click to vote
COMGEO
2010
ACM
15 years 17 days ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
122
Voted
APVIS
2009
15 years 1 months ago
2009
Visualizing large-scale online social network is a challenging yet essential task. This paper presents HiMap, a system that visualizes it by clustered graph via hierarchical group...
102
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...