725 search results - page 116 / 145 » A General Greedy Approximation Algorithm with Applications |
131
click to vote
ESA
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
112
Voted
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
CIKM
2003
Springer
15 years 2 months ago
2003
Springer
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
TCIAIG
2010
14 years 4 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...