Sciweavers

16666 search results - page 394 / 3334
» Descriptive and Computational Complexity
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
WACV
2002
IEEE
15 years 11 months ago
Automatic Pose Estimation of Complex 3D Building Models
3D models of urban sites with geometry and facade textures are needed for many planning and visualization applications. Approximate 3D wireframe model can be derived from aerial i...
Sung Chun Lee, Soon Ki Jung, Ramakant Nevatia
IPPS
2000
IEEE
15 years 11 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
DCC
1998
IEEE
15 years 11 months ago
The H.263+ Video Coding Standard: Complexity and Performance
The ITU-T H.263+ low bit-rate video coding standard is Version 2 of the draft international standard ITU-T H.263. Currently, we are a contributing party in the H.263+ standardizat...
Berna Erol, Michael Gallant, Guy Côté...
PPOPP
1995
ACM
15 years 10 months ago
pC++/streams: a Library for I/O on Complex Distributed Data Structures
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...
Jacob Gotwals, Suresh Srinivas, Dennis Gannon