16404 search results - page 287 / 3281 » A set coverage problem |
145
Voted
CTRSA
2006
Springer
15 years 8 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
133
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
162
click to vote
OPODIS
2007
15 years 6 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
114
Voted
ARSCOM
2008
15 years 4 months ago
2008
We classify the minimal blocking sets of size 15 in PG(2, 9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the u...
120
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...