4894 search results - page 723 / 979 » The Guarding Problem - Complexity and Approximation |
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
SSD
2007
Springer
14 years 2 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 ...
WAW
2007
Springer
14 years 2 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
CVPR
2006
IEEE
14 years 2 months ago
2006
IEEE
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...