503 search results - page 69 / 101 » An Independence Relation for Sets of Secrets |
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
KBSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—As software projects continue to grow in scale, being able to maximize the work that developers can carry out in parallel as a set of concurrent development tasks, without incur...
IWDW
2009
Springer
15 years 4 months ago
2009
Springer
We recently developed a new benchmark for steganography, underpinned by the square root law of capacity, called Steganographic Fisher Information (SFI). It is related to the multip...
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...