Sciweavers

8825 search results - page 17 / 1765
» All for one or one for all
Sort
View
HCI
2001
13 years 9 months ago
Designing Internet-based systems and services for all: problems and solutions
: Most current electronic services do not address the breadth of design issues necessary to comply with `design-for-all' concepts, despite the fact that various design-for-all...
Panayiotis Koutsabasis, Jenny S. Darzentas, Julio ...
BIRTHDAY
2012
Springer
12 years 3 months ago
Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
François-Xavier Standaert, Christophe Petit...
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
11 years 10 months ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
ITNG
2006
IEEE
14 years 1 months ago
Two-Party Private Vector Dominance: The All-Or-Nothing Deal
Alice holds a secret integer a while Bob holds a secret integer b, they want to decide on the predicate a > b with no information revealed other than the result. This is the we...
Maged Hamada Ibrahim
IPPS
2000
IEEE
14 years 5 hour ago
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
Yuanyuan Yang, Jianchao Wang