Sciweavers

572 search results - page 64 / 115
» Exponential-Time Approximation of Hard Problems
Sort
View
NIPS
2008
14 years 11 months ago
Adapting to a Market Shock: Optimal Sequential Market-Making
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
Sanmay Das, Malik Magdon-Ismail
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 28 days ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
14 years 11 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
PVLDB
2010
134views more  PVLDB 2010»
14 years 8 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
90
Voted
FSTTCS
2003
Springer
15 years 3 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...