1302 search results - page 75 / 261 » On the Strong Chromatic Number |
149
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
165
click to vote
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
Recommendation systems can be attacked in various ways, and the ultimate attack form is reached with a sybil attack, where the attacker creates a potentially unlimited number of s...
172
click to vote
SAC
2005
ACM
15 years 12 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
152
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Mass-produced goods tend to be highly standardized in order to maximize manufacturing efficiencies. Some high-value goods with limited production quantities remain much less stand...
157
click to vote
INFORMS
2000
15 years 6 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...