Sciweavers

10820 search results - page 1897 / 2164
» Understanding the
Sort
View
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
15 years 7 months ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
RV
2009
Springer
155views Hardware» more  RV 2009»
15 years 7 months ago
Hardware Supported Flexible Monitoring: Early Results
Monitoring of software’s execution is crucial in numerous software development tasks. Current monitoring efforts generally require extensive instrumentation of the software or d...
Antonia Zhai, Guojin He, Mats Per Erik Heimdahl
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
15 years 7 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 7 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
15 years 7 months ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...
« Prev « First page 1897 / 2164 Last » Next »