Sciweavers

2827 search results - page 46 / 566
» Robustness of PSPACE-complete sets
Sort
View
STACS
2010
Springer
14 years 2 months ago
Robust Fault Tolerant Uncapacitated Facility Location
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
Shiri Chechik, David Peleg
AUTOMATICA
2004
147views more  AUTOMATICA 2004»
13 years 7 months ago
Interval analysis and dioid: application to robust controller design for timed event graphs
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...
IPMU
2010
Springer
13 years 5 months ago
Restricting the IDM for Classification
Abstract. The naive credal classifier (NCC) extends naive Bayes classifier (NBC) to imprecise probabilities to robustly deal with the specification of the prior; NCC models a state...
Giorgio Corani, Alessio Benavoli
ACCV
2010
Springer
13 years 2 months ago
An Efficient RANSAC for 3D Object Recognition in Noisy and Occluded Scenes
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
Chavdar Papazov, Darius Burschka
ECIR
2011
Springer
12 years 11 months ago
Learning Models for Ranking Aggregates
Aggregate ranking tasks are those where documents are not the final ranking outcome, but instead an intermediary component. For instance, in expert search, a ranking of candidate ...
Craig Macdonald, Iadh Ounis