1091 search results - page 155 / 219 » Approximation Algorithms for Data Placement Problems |
135
click to vote
PVLDB
2010
15 years 3 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
147
click to vote
COLT
2003
Springer
15 years 10 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
136
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
128
click to vote
NIPS
2008
15 years 6 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
137
click to vote
SRDS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparen...