2720 search results - page 23 / 544 » How do we count |
139
click to vote
FC
2008
Springer
15 years 4 months ago
2008
Springer
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
105
click to vote
DOCENG
2009
ACM
15 years 9 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
118
click to vote
OPODIS
2004
15 years 4 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
104
click to vote
ARSCOM
2008
15 years 3 months ago
2008
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
137
click to vote
TLT
2008
15 years 3 months ago
2008
While the growing number of learning resources increases the choice for learners on how, what and when to learn, it also makes it more and more difficult to find the learning resou...