138 search results - page 16 / 28 » Algorithms for induced biclique optimization problems |
144
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
130
Voted
HEURISTICS
2008
15 years 3 months ago
2008
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
129
Voted
WINE
2009
Springer
15 years 10 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
184
Voted
OL
2011
14 years 10 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
114
Voted
AAAI
2006
15 years 5 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...