Sciweavers

5595 search results - page 777 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
172
Voted
ICMLA
2008
15 years 8 months ago
Prediction-Directed Compression of POMDPs
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 6 months ago
Longest Common Separable Pattern between Permutations
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
Mathilde Bouvel, Dominique Rossin, Stéphane...
JC
1998
65views more  JC 1998»
15 years 6 months ago
Monte Carlo Complexity of Global Solution of Integral Equations
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
Stefan Heinrich
178
Voted

Publication
433views
16 years 3 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
AAMAS
2011
Springer
15 years 1 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke