Sciweavers

333 search results - page 15 / 67
» curlybot: designing a new class of computational toys
Sort
View
NETWORKS
2011
13 years 2 months ago
On cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
14 years 1 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
ARITH
2003
IEEE
14 years 1 months ago
Saturating Counters: Application and Design Alternatives
We define a new class of parallel counters, Saturating Counters, which provide the exact count of the inputs that are 1 only if this count is below a given threshold. Such counte...
Israel Koren, Yaron Koren, Bejoy G. Oomman
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
13 years 11 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
CRIWG
2006
13 years 9 months ago
Social Visualization Encouraging Participation in Online Communities
The paper describes a further development of the design of a motivational visualization encouraging participation in an online community. The new design overcomes shortcomings in p...
Lingling Sun, Julita Vassileva