Sciweavers

602 search results - page 113 / 121
» A New Rendering Model for X
Sort
View
EUROCRYPT
2008
Springer
13 years 10 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
DAC
2004
ACM
14 years 9 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
MOBIHOC
2004
ACM
14 years 8 months ago
Internal synchronization of drift-constraint clocks in ad-hoc sensor networks
Clock synchronization is a crucial basic service in typical sensor networks, since the observations of distributed sensors more often than not need to be ordered ("a happened...
Lennart Meier, Philipp Blum, Lothar Thiele
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 3 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
14 years 2 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...