Sciweavers

1523 search results - page 7 / 305
» The Computational Complexity of Linear Optics
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 9 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
ICTCS
2003
Springer
14 years 21 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
CGI
2006
IEEE
13 years 11 months ago
Rendering Optical Effects Based on Spectra Representation in Complex Scenes
Rendering the structural color of natural objects or modern industrial products in the 3D environment is not possible with RGBbased graphics platforms and software and very time co...
Weiming Dong
RT
1999
Springer
13 years 11 months ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
CRYPTO
2006
Springer
97views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Robust Multiparty Computation with Linear Communication Complexity
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
Martin Hirt, Jesper Buus Nielsen