16430 search results - page 162 / 3286 » On Computable Tree Functions |
170
Voted
ENTCS
2006
15 years 3 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
154
Voted
LCTRTS
2010
Springer
15 years 10 months ago
2010
Springer
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...
123
Voted
WFLP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
120
Voted
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
132
Voted
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...