Sciweavers

53 search results - page 5 / 11
» On the Size of Monotone Span Programs
Sort
View
DAGSTUHL
2004
13 years 9 months ago
Removing Cycles in Esterel Programs
Abstract. Synchronous programs may contain cyclic signal interdependencies. This prohibits a static scheduling, which limits the choice of available compilation techniques for such...
Jan Lukoschus, Reinhard von Hanxleden
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
12 years 11 months ago
Schema evolution analysis for embedded databases
—Dynamic software updating research efforts have mostly been focused on updating application code and in-memory state. As more and more applications use embedded databases for st...
Shengfeng Wu, Iulian Neamtiu
INDOCRYPT
2003
Springer
14 years 24 days ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 7 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
IADIS
2008
13 years 9 months ago
Dagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fi...