Sciweavers

963 search results - page 131 / 193
» On the decomposition of rational functions
Sort
View
WWW
2008
ACM
14 years 9 months ago
Dynamic cost-per-action mechanisms and applications to online advertising
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 6 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 6 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
14 years 5 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
ATAL
2009
Springer
14 years 3 months ago
Bounded practical social reasoning in the ESB framework
Reasoning about others, as performed by agents in order to coordinate their behaviours with those of others, commonly involves forming and updating beliefs about hidden system pro...
Iain Wallace, Michael Rovatsos