Sciweavers

1018 search results - page 41 / 204
» Generative unbinding of names
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 9 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
ICALT
2011
IEEE
12 years 8 months ago
Tailoring Serious Games with Adaptive Pedagogical Scenarios: A Serious Game for Persons with Cognitive Disabilities
—this work addresses issues relevant to the project CLES (Cognitive and Linguistic Element Stimulation) which aims to develop a serious game for diagnosis and training of childre...
Aarij Mahmood Hussaan, Karim Sehaba, Alain Mille
TSD
2007
Springer
14 years 3 months ago
Logic-Based Rhetorical Structuring for Natural Language Generation in Human-Computer Dialogue
Abstract. Rhetorical structuring is field approached mostly by research in natural language (pragmatic) interpretation. However, in natural language generation (NLG) the rhetorica...
Vladimir Popescu, Jean Caelen, Corneliu Burileanu
VVS
1998
IEEE
126views Visualization» more  VVS 1998»
14 years 1 months ago
Semi-Automatic Generation of Transfer Functions for Direct Volume Rendering
Although direct volume rendering is a powerful tool for visualizing complex structures within volume data, the size and complexity of the parameter space controlling the rendering...
Gordon L. Kindlmann, James W. Durkin
ATAL
2010
Springer
13 years 10 months ago
A distributed algorithm for anytime coalition structure generation
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
Tomasz P. Michalak, Jacek Sroka, Talal Rahwan, Mic...