921 search results - page 95 / 185 » Expressing Computational Complexity in Constructive Type The... |
CHI
1995
ACM
13 years 11 months ago
1995
ACM
The relations among graphical representations, computer functionality, and everyday objects are more complex than terms like “the desktop metaphor” may suggest. While metaphor...
GPCE
2004
Springer
14 years 1 months ago
2004
Springer
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
CDC
2009
IEEE
14 years 20 days ago
2009
IEEE
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...
FOCS
1999
IEEE
14 years 8 days ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
JCT
2007
13 years 7 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...