3775 search results - page 9 / 755 » The Expression Problem Revisited |
DAGSTUHL
2004
13 years 8 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
CAISE
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
DRM
2005
Springer
14 years 27 days ago
2005
Springer
Watermarking technologies have been envisioned as a potential means for establishing ownership on digital media objects. However, achievable robustness and false-positive rates of...
COCOON
2005
Springer
14 years 28 days ago
2005
Springer