3874 search results - page 367 / 775 » Approximation Algorithms for k-hurdle Problems |
240
Voted
ICDE
2006
IEEE
16 years 7 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...
138
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
146
click to vote
ARCS
2006
Springer
15 years 10 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
174
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
147
click to vote
NIPS
2003
15 years 7 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...