727 search results - page 73 / 146 » Private approximation of search problems |
133
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
130
click to vote
HIS
2007
15 years 6 months ago
2007
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
147
click to vote
JMLR
2006
15 years 5 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
176
click to vote
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
288
Voted
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...