347 search results - page 26 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
DANCE
2002
IEEE
15 years 4 months ago
2002
IEEE
Active networking is a powerful technology to insert new functionality into the networking. In this paper we look at how active networking technology can be used to customize netw...
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
115
click to vote
DIS
2001
Springer
15 years 4 months ago
2001
Springer
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
105
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
VLSM
2005
Springer
15 years 5 months ago
2005
Springer
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...