Sciweavers

971 search results - page 33 / 195
» Approximate Satisfiability and Equivalence
Sort
View
AAECC
1995
Springer
137views Algorithms» more  AAECC 1995»
14 years 1 months ago
About Approximations of Exponentials
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
Pierre-Vincent Koseleff
FOCS
2008
IEEE
14 years 4 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
14 years 10 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
ORDER
2008
82views more  ORDER 2008»
13 years 9 months ago
Profinite Heyting Algebras
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
Guram Bezhanishvili, Nick Bezhanishvili
ATAL
2009
Springer
14 years 1 months ago
Improved approximation of interactive dynamic influence diagrams using discriminative model updates
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
Prashant Doshi, Yifeng Zeng