7758 search results - page 1257 / 1552 » On the Number of Distributive Lattices |
195
click to vote
CHES
2011
Springer
14 years 6 months ago
2011
Springer
A lightweight and secure key storage scheme using silicon Physical Unclonable Functions (PUFs) is described. To derive stable PUF bits from chip manufacturing variations, a lightwe...
195
click to vote
COMPSAC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
209
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Models of bags of words typically assume topic mixing so that the words in a single bag come from a limited number of topics. We show here that many sets of bag of words exhibit a...
193
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
249
click to vote
CSCW
2012
ACM
14 years 2 months ago
2012
ACM
Social applications on the web let users track and follow the activities of a large number of others regardless of location or affiliation. There is a potential for this transpare...