3341 search results - page 143 / 669 » On Bounded Queries and Approximation |
WINE
2009
Springer
15 years 4 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
JMLR
2010
14 years 4 months ago
2010
With the increasing popularity of largescale probabilistic graphical models, even "lightweight" approximate inference methods are becoming infeasible. Fortunately, often...
100
click to vote
SSD
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
106
click to vote
TOC
2010
14 years 4 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
102
click to vote
TKDE
2010
14 years 8 months ago
2010
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...