Sciweavers

835 search results - page 47 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
AAAI
2007
14 years 1 months ago
An Ironing-Based Approach to Adaptive Online Mechanism Design in Single-Valued Domains
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...
David C. Parkes, Quang Duong
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
14 years 5 days ago
A RELIEF Based Feature Extraction Algorithm
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...
Yijun Sun, Dapeng Wu
COMGEO
2010
ACM
13 years 11 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
APVIS
2009
13 years 12 months ago
HiMap: Adaptive visualization of large-scale online social networks
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...
Lei Shi, Nan Cao, Shixia Liu, Weihong Qian, Li Tan...
ICPR
2008
IEEE
14 years 5 months ago
Online adaptive clustering in a decision tree framework
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...
Jayanta Basak