3341 search results - page 402 / 669 » On Bounded Queries and Approximation |
183
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
138
click to vote
TSP
2010
15 years 1 months ago
2010
This paper presents a method for signal extraction based on conditional second-order moments of the output of the extraction filter. The estimator of the filter is derived from an ...
189
click to vote
AAAI
2012
13 years 9 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
261
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
219
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...