138 search results - page 8 / 28 » Algorithms for induced biclique optimization problems |
ICML
2004
IEEE
16 years 14 days ago
2004
IEEE
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, ...
174
click to vote
TON
2010
14 years 6 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
HIS
2008
15 years 1 months ago
2008
Most symbolic classifiers aim at building sets of rules with good coverage and precision. While this is suitable for most applications, they tend to neglect other desirable proper...
129
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
IPL
2008
14 years 11 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...