Sciweavers

16430 search results - page 454 / 3286
» On Computable Tree Functions
Sort
View
SFP
2003
15 years 8 months ago
O'Camelot: adding objects to a resource-aware functional language
Abstract: We outline an object-oriented extension to Camelot, a functional language in the ML family designed for resource aware computation. Camelot is compiled for the Java Virtu...
Nicholas Wolverson, Kenneth MacKenzie
DAM
2007
77views more  DAM 2007»
15 years 6 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
IJAR
2010
105views more  IJAR 2010»
15 years 4 months ago
A tree augmented classifier based on Extreme Imprecise Dirichlet Model
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
G. Corani, C. P. de Campos
TCSV
2010
15 years 1 months ago
Quad-Tree Motion Modeling With Leaf Merging
In this paper, we are concerned with the modeling of motion between frames of a video sequence. Typically, it is not possible to represent the motion between frames by a single mod...
Reji Mathew, David S. Taubman
EUROCRYPT
2000
Springer
15 years 10 months ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver