5630 search results - page 164 / 1126 » Computability in Specification |
152
click to vote
BIRTHDAY
2009
Springer
15 years 2 months ago
2009
Springer
Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A gene...
120
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
127
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
153
click to vote
CCS
2010
ACM
15 years 4 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
141
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n