16430 search results - page 526 / 3286 » On Computable Tree Functions |
173
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
178
click to vote
GECCO
2005
Springer
16 years 17 days ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
182
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...
161
click to vote
SKG
2006
IEEE
16 years 1 months ago
2006
IEEE
The paper studies “equality” in XML model decomposition. XML IFD, TFD, AFD and MVD are proposed. According to complexity of these FDs, four XML normal forms are presented. FD ...
187
click to vote
GI
1999
Springer
15 years 11 months ago
1999
Springer
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of...