1464 search results - page 148 / 293 » On optimal anonymization for l -diversity |
166
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
273
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
191
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
155
click to vote
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
169
click to vote
NAR
2008
15 years 6 months ago
2008
The InParanoid eukaryotic ortholog database (http://InParanoid.sbc.su.se/) has been updated to version 6 and is now based on 35 species. We collected all available `complete'...