183 search results - page 23 / 37 » Geometric Optimization Problems Over Sliding Windows |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
SIAMCO
2002
13 years 8 months ago
2002
We consider a market model with one riskfree and one risky asset, in which the dynamics of the risky asset is governed by a geometric Brownian motion. In this market we consider a...
SODA
1996
ACM
13 years 10 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
QSHINE
2005
IEEE
14 years 2 months ago
2005
IEEE
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
NHM
2010
13 years 3 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...