Sciweavers

3378 search results - page 192 / 676
» A universe of binding and computation
Sort
View
WOTE
2010
15 years 4 months ago
On Some Incompatible Properties of Voting Schemes
Abstract. In this paper, we study the problem of simultaneously achieving several security properties, for voting schemes, without non-standard assumptions. More specifically, we ...
Benoît Chevallier-Mames, Pierre-Alain Fouque...
TOG
2012
234views Communications» more  TOG 2012»
13 years 9 months ago
Fast automatic skinning transformations
Algebra I, II Complex Variables I, II Analysis I, II Awards, Scholarships, Fellowships Received • Back Cover Image, Proceedings of ACM SIGGRAPH, 2011 • New York University Henr...
Alec Jacobson, Ilya Baran, Ladislav Kavan, Jovan P...
ICSE
2003
IEEE-ACM
16 years 6 months ago
Fragment Class Analysis for Testing of Polymorphism in Java Software
Testing of polymorphism in object-oriented software may require coverage of all possible bindings of receiver classes and target methods at call sites. Tools that measure this cove...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
SAC
2009
ACM
16 years 1 months ago
Two lower bounds for self-assemblies at temperature 1
Abstract—Using the Tile Assembly Model proposed by Rothemund and Winfree, we give two lower bounds on the minimum number of tile types needed to uniquely assemble a shape at temp...
Ján Manuch, Ladislav Stacho, Christine Stol...
SAC
2009
ACM
16 years 1 months ago
Evaluating algorithms that learn from data streams
In the past years, the theory and practice of machine learning and data mining have been focused on static and finite data sets from where learning algorithms generate a static m...
João Gama, Pedro Pereira Rodrigues, Raquel ...