Sciweavers

2681 search results - page 166 / 537
» Problem F
Sort
View
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 10 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
IPL
2002
90views more  IPL 2002»
13 years 10 months ago
Recognition and dualization of disguised bidual Horn functions
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
ICCV
2007
IEEE
15 years 18 days ago
Efficient Computation of the Inverse Gradient on Irregular Domains
The inverse gradient problem, finding a scalar field f with a gradient near a given vector field g on some bounded and connected domain Rn , can be solved by means of a Poisson ...
Gunnar Farnebäck, Hans Knutsson, Joakim Rydel...
CSCW
2002
ACM
13 years 10 months ago
Stimulating social engagement in a community network
One of the most challenging problems facing builders and facilitators of community networks is to create and sustain social engagement among members. In this paper, we investigate...
David R. Millen, John F. Patterson