Sciweavers

1071 search results - page 148 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
COMPGEOM
2010
ACM
14 years 1 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 5 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
OPODIS
2004
13 years 9 months ago
Embedded Systems - Challenges and Work Directions
Embedded Systems are components integrating software and hardware jointly and specifically designed to provide given functionalities. These components may be used in many different...
Joseph Sifakis
BMCBI
2010
95views more  BMCBI 2010»
13 years 8 months ago
Spatio-structural granularity of biological material entities
Background: With the continuously increasing demands on knowledge- and data-management that databases have to meet, ontologies and the theories of granularity they use become more...
Lars Vogt