1554 search results - page 107 / 311 » Parameterized Complexity and Approximation Algorithms |
185
Voted
ICCV
1999
IEEE
16 years 4 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
111
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...
131
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
150
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
133
click to vote
NIPS
2007
15 years 5 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...