Sciweavers

4355 search results - page 710 / 871
» Increasing Kolmogorov Complexity
Sort
View
PODC
2005
ACM
16 years 28 min ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
15 years 12 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 ...
FSMNLP
2005
Springer
15 years 12 months ago
German Compound Analysis with wfsc
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
Anne Schiller
UML
2005
Springer
15 years 12 months ago
Workshop Report: Model Driven Development of Advanced User Interfaces (MDDAUI)
Abstract. This paper reports about the workshop Model Driven Development of Advanced User Interfaces (MDDAUI) which was held on October 2nd, 2005 at the MoDELS/UML 2005 conference ...
Andreas Pleuß, Jan Van den Bergh, Stefan Sau...
DAC
2004
ACM
15 years 12 months ago
Extending the transaction level modeling approach for fast communication architecture exploration
System-on-Chip (SoC) designs are increasingly becoming more complex. Efficient on-chip communication architectures are critical for achieving desired performance in these systems....
Sudeep Pasricha, Nikil D. Dutt, Mohamed Ben-Romdha...