16430 search results - page 335 / 3286 » On Computable Tree Functions |
190
click to vote
IACR
2011
14 years 4 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
129
click to vote
SIGGRAPH
1999
ACM
15 years 9 months ago
1999
ACM
Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple referenc...
148
click to vote
AI
2008
Springer
15 years 5 months ago
2008
Springer
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
140
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
164
click to vote
IANDC
2011
14 years 12 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...