2125 search results - page 222 / 425 » On Graph Complexity |
147
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
146
click to vote
PPOPP
2006
ACM
15 years 9 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
138
Voted
CSJM
2006
15 years 3 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
143
Voted
SSDBM
2005
IEEE
15 years 9 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
142
Voted
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...