7930 search results - page 658 / 1586 » Greedy in Approximation Algorithms |
199
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
202
Voted
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
204
click to vote
AAAI
2006
15 years 8 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
206
click to vote
IR
2010
15 years 5 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
264
Voted
ESA
2011
Springer
14 years 7 months ago
2011
Springer
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...