Sciweavers

14774 search results - page 182 / 2955
» Computational complexity and evolutionary computation
Sort
View
161
Voted
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
140
Voted
ICASSP
2011
IEEE
14 years 8 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
SAC
2010
ACM
15 years 11 months ago
Gray networking: a step towards next generation computer networks
Modern networks are very complex. It is highly desirable to reduce management complexity in next generation network design. Researchers have been seeking inspiration in natural ob...
Piyush Harsh, Randy Chow, Richard Newman
132
Voted
FDG
2009
ACM
15 years 11 months ago
Relating cognitive models of computer games to user evaluations of entertainment
As the interactive entertainment industry matures, a better understanding of what makes software entertaining is needed. A natural starting point is the application of traditional...
Paolo Piselli, Mark Claypool, James Doyle
IPPS
2003
IEEE
15 years 10 months ago
Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
João M. P. Cardoso