Sciweavers

1350 search results - page 24 / 270
» Generalized Committed Choice
Sort
View
IJCV
2007
144views more  IJCV 2007»
14 years 9 months ago
Generalized Gradients: Priors on Minimization Flows
This paper tackles an important aspect of the variational problem underlying active contours: optimization by gradient flows. Classically, the definition of a gradient depends d...
Guillaume Charpiat, Pierre Maurel, Jean-Philippe P...
IOR
2006
93views more  IOR 2006»
14 years 9 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
ACOM
2006
Springer
15 years 3 months ago
Towards Design Tools for Protocol Development
Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools th...
Pinar Yolum
72
Voted
EUROCRYPT
1999
Springer
15 years 1 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
JAPLL
2011
108views more  JAPLL 2011»
14 years 4 months ago
A deontic logic framework allowing for factual detachment
Due to the fact that a large number of our ethical and behavioural norms have a conditional form, it is of great importance that deontic logics give an account of deontic commitme...
Christian Straßer