696 search results - page 106 / 140 » A class of combinatorial identities |
112
click to vote
TCC
2009
Springer
16 years 2 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
147
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
117
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
114
Voted
IJFCS
2008
15 years 1 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
120
click to vote
AMMA
2009
Springer
15 years 8 months ago
2009
Springer
I study school assignment problems, focusing on two popular mechanisms: the Boston Mechanism (BM) and Deferred Acceptance (DA). The former has been criticized regarding both e¢ c...