Sciweavers

2311 search results - page 137 / 463
» Robustness and Generalization
Sort
View
ASIACRYPT
2000
Springer
15 years 9 months ago
Addition of ElGamal Plaintexts
Abstract. We introduce an efficient method for performing computation on encrypted data, allowing addition of ElGamal encrypted plaintexts. We demonstrate a solution that is robust...
Markus Jakobsson, Ari Juels
DCC
1999
IEEE
15 years 9 months ago
Quantized Frame Expansions as Source-Channel Codes for Erasure Channels
Quantized frame expansions are proposed as a method for generalized multiple description coding, where each quantized coe cient is a description. Whereas previous investigations h...
Vivek K. Goyal, Jelena Kovacevic, Martin Vetterli
BIOADIT
2006
Springer
15 years 8 months ago
Resilient Multi-path Routing Based on a Biological Attractor Selection Scheme
In this paper we propose a resilient scheme for multi-path routing using a biologically-inspired attractor selection method. The main advantage of this approach is that it is highl...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
DLT
2007
15 years 6 months ago
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
Marcella Anselmo, Dora Giammarresi, Maria Madonia
140
Voted
MVA
2007
149views Computer Vision» more  MVA 2007»
15 years 6 months ago
Fast Graph Segmentation Based on Statistical Aggregation Phenomena
In this paper, we first generalize a recent statistical color image segmentation algorithm [5] to arbitrary graphs, and report its performance for 2D images, 3D meshes and volume...
Frank Nielsen, Richard Nock