7015 search results - page 276 / 1403 » Approximation algorithms for co-clustering |
137
click to vote
TALG
2010
15 years 5 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
128
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Previous algorithms for learning lexicographic preference models (LPMs) produce a "best guess" LPM that is consistent with the observations. Our approach is more democra...
219
click to vote
ICAPR
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
177
click to vote
ICDM
2007
IEEE
16 years 29 days ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
160
click to vote
IROS
2007
IEEE
16 years 28 days ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...