536 search results - page 26 / 108 » The hardness and approximation algorithms for l-diversity |
FUIN
2006
13 years 8 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
DAC
1998
ACM
14 years 9 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
MP
2006
13 years 8 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
IS
2008
13 years 8 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...