Sciweavers

2992 search results - page 168 / 599
» Semantic Distance Measures
Sort
View
ORL
2008
99views more  ORL 2008»
15 years 4 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
JHSN
2006
100views more  JHSN 2006»
15 years 4 months ago
Reconfiguring Role Based Access Control policies using risk semantics
We present a refined model for Role Based Access Control policies and define a risk measure for the model, which expresses elements of the operational, combinatorial and conflict ...
Benjamin Aziz, Simon N. Foley, John Herbert, Garre...
ENTCS
2008
120views more  ENTCS 2008»
15 years 4 months ago
Towards a Quantum Calculus: (Work in Progress, Extended Abstract)
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
Philippe Jorrand, Simon Perdrix
ECCV
2002
Springer
16 years 6 months ago
On Affine Invariant Clustering and Automatic Cast Listing in Movies
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
Andrew W. Fitzgibbon, Andrew Zisserman
KIVS
2007
Springer
15 years 10 months ago
Improved Locality-Aware Grouping in Overlay Networks
Abstract The performance of peer-to-peer and overlay networks depends to a great extent on their awareness of the underlying network’s properties. Several schemes for estimating ...
Matthias Scheidegger, Torsten Braun