2924 search results - page 506 / 585 » Lower Bounds in Distributed Computing |
125
click to vote
PVLDB
2008
15 years 3 months ago
2008
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
163
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
135
click to vote
ALENEX
2009
15 years 2 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
151
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
151
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...