Sciweavers

4894 search results - page 782 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
VLDB
2005
ACM
196views Database» more  VLDB 2005»
14 years 1 months ago
Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...
Graham Cormode, S. Muthukrishnan, Irina Rozenbaum
AMAI
2004
Springer
14 years 1 months ago
A Framework for Sequential Planning in Multi-Agent Settings
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
Piotr J. Gmytrasiewicz, Prashant Doshi
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
14 years 1 months ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
COMPGEOM
2010
ACM
14 years 29 days ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
14 years 28 days ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth