849 search results - page 2 / 170 » Completely Non-malleable Schemes |
109
click to vote
MOR
2000
15 years 4 days ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
69
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Mobile reception of digital TV often suffers from lost blocks and slices due to suboptimal channels. Inter-sequence error concealment reconstructs lost image blocks of distorted h...
JPDC
2000
15 years 4 days ago
2000
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
126
click to vote
CP
2010
Springer
14 years 11 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
94
Voted
IANDC
2010
14 years 11 months ago
2010
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...