1026 search results - page 108 / 206 » On Finding Minimal w-cutset |
272
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
223
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
169
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
176
click to vote
CODES
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we present an approach to the scheduling and voltage scaling of low-power fault-tolerant hard real-time applications mapped on distributed heterogeneous embedded sys...
253
click to vote
SSD
2007
Springer
16 years 1 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...