2877 search results - page 145 / 576 » The Complexity of Planarity Testing |
167
click to vote
CRYPTO
2008
Springer
15 years 6 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
138
click to vote
SAS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
155
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
142
click to vote
MM
2006
ACM
15 years 10 months ago
2006
ACM
We create interactive art that can be enjoyed by groups such as audiences at public events with the intent to encourage communication with those around us as we play with the art....
139
Voted
SIGMETRICS
2010
ACM
15 years 9 months ago
2010
ACM
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...