16430 search results - page 96 / 3286 » On Computable Tree Functions |
149
Voted
DAM
2011
14 years 10 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
104
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy deci...
118
Voted
RSA
2006
15 years 3 months ago
2006
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...
131
Voted
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
111
Voted
WABI
2007
Springer
15 years 9 months ago
2007
Springer
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...