Sciweavers

502 search results - page 42 / 101
» Monotone Approximation of Decision Problems
Sort
View
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
15 years 4 months ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
92
Voted
INFOCOM
2012
IEEE
13 years 3 days ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
15 years 10 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 3 days ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
104
Voted
PODS
2003
ACM
132views Database» more  PODS 2003»
15 years 9 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy