7930 search results - page 399 / 1586 » Greedy in Approximation Algorithms |
135
Voted
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...
224
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...
181
click to vote
ICDM
2007
IEEE
16 years 1 months 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...
163
click to vote
IROS
2007
IEEE
16 years 1 months 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 ...
202
click to vote
STACS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...