Sciweavers

37 search results - page 6 / 8
» Modeling and rendering of impossible figures
Sort
View
EUROCRYPT
2008
Springer
13 years 7 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
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 7 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
ISMAR
2009
IEEE
14 years 13 days ago
Dynamic seethroughs: Synthesizing hidden views of moving objects
This paper presents a method to create an illusion of seeing moving objects through occluding surfaces in a video. This illusion is achieved by transferring information from a cam...
Peter Barnum, Yaser Sheikh, Ankur Datta, Takeo Kan...
LPNMR
2009
Springer
14 years 10 days ago
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
Harold Ishebabi, Philipp Mahr, Christophe Bobda, M...
NPAR
2010
ACM
13 years 11 months ago
Vector fluid: a vector graphics depiction of surface flow
We present a simple technique for creating fluid silhouettes described with vector graphics, which we call ”Vector Fluid.” In our system, a solid region in the fluid is repr...
Ryoichi Ando, Reiji Tsuruno