4698 search results - page 130 / 940 » Making Functionality More General |
174
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
200
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
163
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
179
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
173
click to vote
JMIV
2006
15 years 6 months ago
2006
We present a novel representation of shape for closed contours in R2 or for compact surfaces in R3 explicitly designed to possess a linear structure. This greatly simplifies linear...