47 search results - page 10 / 10 » An O(n)-Time Algorithm for the Paired-Domination Problem on ... |
ICDE
2010
IEEE
14 years 8 days ago
2010
IEEE
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...