8874 search results - page 188 / 1775 » A New Implementation of Automath |
157
click to vote
AAAI
2011
14 years 4 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
127
click to vote
CPP
2011
14 years 4 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
166
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Event-driven programming is used in many fields of modern Computer Science. In event-driven programming languages user interacts with a program by triggering the events. We propo...
141
click to vote
IACR
2011
14 years 3 months ago
2011
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
111
click to vote
ICPP
1993
IEEE
15 years 8 months ago
1993
IEEE
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...