Sciweavers

697 search results - page 58 / 140
» On the Theory of Average Case Complexity
Sort
View
ISOLA
2010
Springer
13 years 6 months ago
LivingKnowledge: Kernel Methods for Relational Learning and Semantic Modeling
Latest results of statistical learning theory have provided techniques such us pattern analysis and relational learning, which help in modeling system behavior, e.g. the semantics ...
Alessandro Moschitti
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 8 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
INFOCOM
2009
IEEE
14 years 2 months ago
Minimizing Delay for Multicast-Streaming in Wireless Networks with Network Coding
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
Wai-Leong Yeow, Anh Tuan Hoang, Chen-Khong Tham
WWW
2008
ACM
14 years 8 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
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen