Sciweavers

1434 search results - page 192 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
108
Voted
AI
2003
Springer
15 years 7 months ago
Iterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Kevin Smyth, Holger H. Hoos, Thomas Stützle
GLOBECOM
2009
IEEE
15 years 6 months ago
Adding Integrity Verification Capabilities to the LDPC-Staircase Erasure Correction Codes
File distribution is becoming a key technology, in particular in large scale content broadcasting systems like DVBH/SH. They largely rely on Application Level FEC codes (ALFEC) in ...
Mathieu Cunche, Vincent Roca
116
Voted
FC
2000
Springer
119views Cryptology» more  FC 2000»
15 years 5 months ago
Sharing Decryption in the Context of Voting or Lotteries
Abstract. Several public key cryptosystems with additional homomorphic properties have been proposed so far. They allow to perform computation with encrypted data without the knowl...
Pierre-Alain Fouque, Guillaume Poupard, Jacques St...
116
Voted
DICTA
2003
15 years 3 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung
WSC
1998
15 years 3 months ago
Bootstrapping and Validation of Metamodels in Simulation
Bootstrapping is a resampling technique that requires less computer time than simulation does. Bootstrapping -like simulation-must be defined for each type of application. This pa...
Jack P. C. Kleijnen, A. J. Feelders, Russell C. H....