Sciweavers

2698 search results - page 239 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
JAIR
2006
160views more  JAIR 2006»
15 years 6 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
INFOCOM
2003
IEEE
15 years 12 months ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
16 years 28 days ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
SMI
2007
IEEE
208views Image Analysis» more  SMI 2007»
16 years 26 days ago
A Partition-of-Unity Based Algorithm for Implicit Surface Reconstruction Using Belief Propagation
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
Yi-Ling Chen, Shang-Hong Lai
TOC
2010
127views Management» more  TOC 2010»
15 years 1 months ago
The Submodular Welfare Problem with Demand Queries
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
Uriel Feige, Jan Vondrák