Sciweavers

203 search results - page 38 / 41
» Exponentiable morphisms of domains
Sort
View
FOCS
2003
IEEE
14 years 25 days ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 10 days ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden
CP
2000
Springer
13 years 11 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
ATAL
2008
Springer
13 years 9 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ATAL
2008
Springer
13 years 9 months ago
Content-oriented composite service negotiation with complex preferences
In e-commerce, for some cases the service requested by the consumer cannot be fulfilled by the producer. In such cases, service consumers and producers need to negotiate their ser...
Reyhan Aydogan